Acta Metallurgica Sinica(English letters) ›› 2007, Vol. 14 ›› Issue (4): 82-87.doi: 1005-8885 (2007) 04-0082-06

• Wireless • Previous Articles     Next Articles

Efficient delay based scheduling with fairness in multi-hop wireless mesh networks

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

  1. Wireless Signal Processing and Network Laboratory, Beijing University of Posts and Telecommunications
  • Received:2007-01-26 Revised:1900-01-01 Online:2007-12-24
  • Contact: WANG Kun


Some scheduling algorithms have been designed to improve the performance of multi-hop wireless mesh networks (WMNs) recently. However the end-to-end delay is seldom considered as the complexity of multi-hop topology and open wireless shared channel. This article proposes an efficient delay based scheduling algorithm with the concept of buffer-data- hops. Considering the demand satisfaction factor (DSF), the proposed algorithm can also achieve a good fairness performance. Moreover, with the interference-based network model, the scheduling algorithm can maximize the spatial reuse, compared to those graph-based scheduling algorithms. Detailed theoretical analysis shows that the algorithm can minimize the end-to-end delay and make a fair scheduling to all the links.

Key words:

WMNs; scheduling algorithm; delay; fairness; spatial reuse