北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (4): 33-36.doi: 10.13190/jbupt.200704.33.wangyj

• 论文 • 上一篇    下一篇

无线Mesh网络的最大并发公平调度

王英杰 吴振华 刘觅 彭木根 王文博   

  1. (北京邮电大学 无线信号处理与网络实验室, 北京 100876)
  • 收稿日期:2006-09-05 修回日期:2007-01-12 出版日期:2007-08-30 发布日期:2007-08-30
  • 通讯作者: 王英杰

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

摘要:

研究了基于IEEE 802.16标准的集中式控制无线Mesh网络,提出了一种基于干扰集的树形路由和基于最大并发集的公平下行调度算法. 该路由算法使树上节点具有较小的干扰度,从而达到干扰避免的效果. 基于此干扰避免树的下行调度实现对最大并发集的高效利用,同时尽量保证节点业务请求满意率的公平性. 仿真结果表明,由于节点干扰度的降低以及并发传输机会的增加,网络吞吐量得到提高,并满足了一定的公平性要求.

关键词: 无线Mesh网络, 树型路由, 下行调度

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

中图分类号: