Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2007, Vol. 30 ›› Issue (4): 33-36.doi: 10.13190/jbupt.200704.33.wangyj

• Papers • Previous Articles     Next Articles

Fair Scheduling for Maximal Concurrent Transmissions in Wireless Mesh Networks

WANG Ying-jie,LIU Mi,WU Zhen-hua,PENG Mu-gen,WANG Wen-bo   

  1. (Wireless Signal Processing and Network Lab, Beijing University of Posts and Telecommunications, Beijing 100876, China)
  • Received:2006-09-05 Revised:2007-01-12 Online:2007-08-30 Published:2007-08-30
  • Contact: WANG Ying-jie

Abstract:

The wireless mesh networks based on the IEEE 802.16 standard and controlled in a centralizedway were studied. And an interference set based tree routing algorithm and a maximal clique based fair downlink scheduling algorithm were proposed. The proposed routing algorithm will make the nodes on the routing tree be of less interference degree in order to get an interference-aware tree, while the proposed downlink scheduling on the basis of this tree will take full advantage of maximal cliques, as well as ensures fairness among request satisfaction ratios. Simulation shows that a great network throughput enhancement which is benefited from the decrease of node’s interference degree along with the increase of concurrent transmissions, and a satisfaction with the fairness.

Key words: wireless mesh networks, tree routing, downlink scheduling

CLC Number: