Scheduling algorithms in broad-band wireless networks

Authors
Citation
Yx. Cao et Vok. Li, Scheduling algorithms in broad-band wireless networks, P IEEE, 89(1), 2001, pp. 76-87
Citations number
36
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
PROCEEDINGS OF THE IEEE
ISSN journal
00189219 → ACNP
Volume
89
Issue
1
Year of publication
2001
Pages
76 - 87
Database
ISI
SICI code
0018-9219(200101)89:1<76:SAIBWN>2.0.ZU;2-M
Abstract
Scheduling algorithms that support quality of service (QoS) differentiation and guarantees for wireless data networks are crucial to the development o f broad-band wireless networks. Wireless communication poses special proble ms that do not exist in wireline networks, such as time-varying channel cap acity and location-dependent errors. Although many mature scheduling algori thms are available, for wireless networks, they are not directly applicable in,wireless networks because of these special problems. This paper provide s a comprehensive and in-depth survey on recent research in wireless schedu ling. The problems and difficulties in wireless scheduling are discussed. V arious representative algorithms are examined. Their themes of thoughts and pros aim cons are compared and annalyzed. At the end of the paper, some op en questions and future research directions are addressed.