中国邮电高校学报(英文) ›› 2007, Vol. 14 ›› Issue (3): 22-27.doi: 1005-8885 (2007) 03-0022-06

• Wireless • 上一篇    下一篇

Distributed scheduling based on polling policy with maximal spatial reuse in multi-hop WMNs

王坤;彭木根;王文博   

  1. Wireless Signal Processing and Network Laboratory,
    Beijing University of Posts and Telecommunications, Beijing 100876, China
  • 收稿日期:2006-12-27 修回日期:1900-01-01 出版日期:2007-09-30

Distributed scheduling based on polling policy with maximal spatial reuse in multi-hop WMNs

WANG Kun;PENG Mu-gen; WANG Wen-bo   

  1. Wireless Signal Processing and Network Laboratory,
    Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2006-12-27 Revised:1900-01-01 Online:2007-09-30

摘要:

The scheduling algorithm based on the three-way handshaking scheme in IEEE 802.16d-2004 standard has some serious problems because of the complexity of the algorithm and low scheduling efficiency. To enhance the scheduling efficiency and improve the performance of multi-hop wireless mesh networks (WMNs), one distributed scheduling algorithm that can maximize the spatial and time reuse with an interference-based network model is proposed. Compared to the graph-based network model, the proposed network model can achieve a better throughput performance with maximal spatial reuse. Furthermore, this proposed scheduling algorithm also keeps fairly scheduling to all links, with a priority-based polling policy. Both the theoretical analysis and simulation results show that this proposed distributed scheduling algorithm is simple and efficient.

关键词:

WMNs; distributed scheduling algorithm; spatial reuse; polling policy

Abstract:

The scheduling algorithm based on the three-way handshaking scheme in IEEE 802.16d-2004 standard has some serious problems because of the complexity of the algorithm and low scheduling efficiency. To enhance the scheduling efficiency and improve the performance of multi-hop wireless mesh networks (WMNs), one distributed scheduling algorithm that can maximize the spatial and time reuse with an interference-based network model is proposed. Compared to the graph-based network model, the proposed network model can achieve a better throughput performance with maximal spatial reuse. Furthermore, this proposed scheduling algorithm also keeps fairly scheduling to all links, with a priority-based polling policy. Both the theoretical analysis and simulation results show that this proposed distributed scheduling algorithm is simple and efficient.

Key words:

WMNs; distributed scheduling algorithm; spatial reuse; polling policy

中图分类号: