Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2008, Vol. 31 ›› Issue (2): 38-41.doi: 10.13190/jbupt.200802.38.wangk

• Papers • Previous Articles     Next Articles

Link Scheduling with Fairness and Delay Guarantee in Multi-hop Wireless Networks

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

  1. Key Laboratory of Universal Wireless Communication, Ministry of Education,Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2007-07-14 Revised:1900-01-01 Online:2008-04-28 Published:2008-04-28
  • Contact: WANG Kun

Abstract:

The relationship between link scheduling scheme and the performance of user fairness and delay guarantee is detailed analyzed. In order to guarantee user fairness and reduce end-to-end delay, the concept of “link scheduling periods” and “link hop degree” are introduced. One suboptimal user fairness and delay guarantee link scheduling algorithm is proposed based on the user fairness optimization problem model. To guarantee the performance of system throughput, both the spatial reuse and link quality are considered. Theoretical analysis and simulation show that the proposed algorithm can enhance the performance of user fairness and delay effectively with a certain system throughput guarantee.

Key words: multi-hop wireless networks, link scheduling, system throughput, user fairness, delay

CLC Number: