Patent ID: 7688830

Claim:
A method of flail-distributed packet scheduling for a network packet scheduling unit of a wireless network, comprising the steps of: constructing a factor graph using a network modeling unit to model network nodes and network links of a multi-hop wireless network, said factor graph including a plurality of agent nodes, a plurality of variable nodes and a plurality of edges, said factor graph being a graph of a group of mutually-interactive constrain rules; transforming said packet scheduling into a decoding problem for a low-density parity-check (LDPC) code based on said factor graph, and solving said decoding problem through a standard process in said network packet scheduling unit; and applying a weighting scheme on a packet schedule obtained from solving said decoding problem according to network condition; wherein said network packet scheduling unit collects information on packet queue lengths of neighboring agent nodes for each agent node, and computing a weight for each agent node in a local transmission pattern of each local link of each agent node, said weight of an agent node i in the local transmission pattern of a k-th local link of said agent node i is computed as follows: ω ⁢ ⁢ t ⁡ ( f 1 ⁢ { 0 , … ⁢ , 0 , 1 , 0 , … ⁢ , 0 } ) = sum ⁢ ⁢ of ⁢ ⁢ { max ⁡ ( x T , t ⁡ ( k ) - x R , t ⁡ ( k ) , 0 ) / max ⁡ ( x T , t ⁡ ( h ) - x R , t ⁡ ( h ) , ɛ ) } wherein ƒ i is a constrain function corresponding to said agent node i, max( ) represents a maximum function, ε is a positive number, x T,t (k)−x R,t (k) represents total number of packets that reach a destination queue through the k-th local link of said agent node i, x T,t (h)−x R,t (h) represents total number of packets that reach the destination queue through an h-th local link of said agent node i, h is not equal to k, subscripts T and R represent a transmitting end and a receiving end of a local link, and t is a concerned packet slot index.