期刊文献+

一种新颖的无线网状网的混合调度策略

New Hybrid Scheduling for Improving Capacity of Wireless Mesh Network
下载PDF
导出
摘要 提出一种新颖的时分复用与最大调度的混合调度算法,解决了单信道无线网状网中,当同一时刻待传输链路突增时,信道竞争冲突加剧,网络容量显著下降的问题.算法根据链路与系统子时隙染色,使每条链路都有唯一系统子时隙相对应,链路在同色子时隙上实现时分复用调度;在异色子时隙空闲时,实现链路的最大调度.此算法具有时分复用和最大调度两种调度算法的优点.文中利用李雅普诺夫稳定性定理证明了算法的效率比率.仿真结果表明,该算法下的网络容量有明显提升. This paper presents a new hybrid scheduling algorithm based on time division multiple access(TDMA) and maximal scheduling for multi-hop wireless mesh networks.It solves the problem that the capacity of wireless mesh network obviously drops when the active transmitters increase since the probability of collisions increases.In this algorithm,each link is assigned with one sub-timeslot with the same colors.According to the color of links,each link can be scheduled directly on the sub-timeslot of same color as link with TDMA algorithm,and links can be scheduled with maximal scheduling on the sub-timeslots of different colors from links,when these sub-timeslots are not occupied.The analysis of algorithm shows that our proposed hybrid algorithm can achieve a provable fraction of the maximum system capacity.The simulation results show significant improvement in network throughput when compared with 802.11-based mesh networks using maximal scheduling algorithm.
出处 《小型微型计算机系统》 CSCD 北大核心 2011年第5期871-874,共4页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(60496315,60802009)资助 国家“八六三”高技术研究发展计划项目(2008AA01Z204,2009AA01Z205)资助 国际科技合作计划项目(2008DFA11630)资助
关键词 无线网状网 时分复用 最大调度 效率比率 wireless mesh network TDMA maximal scheduling efficiency ratio
  • 相关文献

参考文献8

  • 1Sarkar S, Chaporkar P, Kar K. Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks [ C ]. In Proe. of the 4th International Symposium on Modeling and Optimi- zation in Mobile, Ad-hoc and Wireless Networks, 2006, 286-298.
  • 2Li Q, Negi R. Scheduling in multi-hop wireless networks with pri- orities[ C]. In Proe. of the IEEE Conference on Computer Commu- nications, 2009.
  • 3Lin Xiao-jun, ROSOOL S B. Constant-time distributed scheduling policies for ad hoe wireless network[C]. In Proc. of the 45^th IEEE Conference on Decision and Control, 2006, 1258-1263.
  • 4Lin X, Rasool S. A distributed joint channel-assignment, schedu- ling and routing algorithm for multi-channel ad-hoc wireless net- works[ C]. In Proc. of IEEE INFOCOM, May 2007, 1118-1126.
  • 5Wu Zhi-bin, Dipankar raychaudhuri. Integrated routing and MAC scheduling for single-channel wireless mesh networks [ C ]. In WoWMoM2008, June 2008.
  • 6Ma Li, Zhu Guang-xi, Yin Bo-yun. Optimization models of multi- channel assignment in multi-radio wireless mesh networks [ C ]. Proc. of the 4th International Conference on Wireless Communica- tion, Networking and Mobile Computing, 2008, 1-5.
  • 7Michael J Neely, Eytan Modiano, Charles E Rohrs. Dynamic pow- er allocation and muting for time varying wireless networks[ C]. In Proc. of the IEEE Coference on Computer Communications, San Francisco, April 2003.
  • 8Subramanian A P, Gupta H, DAS S R. Minimum interference channel assignment in multi-radio wireless mesh networks [ C ]. Proc. of the 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad hoc Communications and Networks, 2007, 481-490.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部