File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Scheduling algorithms in broadband wireless networks

TitleScheduling algorithms in broadband wireless networks
Authors
KeywordsBroad-band wireless networks
QoS
scheduling
Issue Date2001
PublisherIEEE.
Citation
Institute of Electrical and Electronics Engineers Proceedings, 2001, v. 89 n. 1, p. 76-87 How to Cite?
AbstractScheduling algorithms that support quality of service (QoS) differentiation and guarantees for wireless data networks are crucial to the development of broadband wireless networks. Wireless communication poses special problems that do not exist in wireline networks, such as time-varying channel capacity and location-dependent errors. Although many mature scheduling algorithms are available for wireline networks, they are not directly applicable in wireless networks because of these special problems. This paper provides a comprehensive and in-depth survey on recent research in wireless scheduling. The problems and difficulties in wireless scheduling are discussed. Various representative algorithms are examined. Their themes of thoughts and pros and cons are compared and analyzed. At the end of the paper, some open questions and future research directions are addressed.
Persistent Identifierhttp://hdl.handle.net/10722/44852
ISSN
2015 Impact Factor: 5.629
2015 SCImago Journal Rankings: 1.586

 

DC FieldValueLanguage
dc.contributor.authorCao, Yen_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2007-10-30T06:11:38Z-
dc.date.available2007-10-30T06:11:38Z-
dc.date.issued2001en_HK
dc.identifier.citationInstitute of Electrical and Electronics Engineers Proceedings, 2001, v. 89 n. 1, p. 76-87en_HK
dc.identifier.issn0018-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/44852-
dc.description.abstractScheduling algorithms that support quality of service (QoS) differentiation and guarantees for wireless data networks are crucial to the development of broadband wireless networks. Wireless communication poses special problems that do not exist in wireline networks, such as time-varying channel capacity and location-dependent errors. Although many mature scheduling algorithms are available for wireline networks, they are not directly applicable in wireless networks because of these special problems. This paper provides a comprehensive and in-depth survey on recent research in wireless scheduling. The problems and difficulties in wireless scheduling are discussed. Various representative algorithms are examined. Their themes of thoughts and pros and cons are compared and analyzed. At the end of the paper, some open questions and future research directions are addressed.en_HK
dc.format.extent133834 bytes-
dc.format.extent4152649 bytes-
dc.format.extent23319 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectBroad-band wireless networksen_HK
dc.subjectQoSen_HK
dc.subjectschedulingen_HK
dc.titleScheduling algorithms in broadband wireless networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0018-9219&volume=89&issue=1&spage=76&epage=87&date=2001&atitle=Scheduling+algorithms+in+broadband+wireless+networksen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/5.904507en_HK
dc.identifier.scopuseid_2-s2.0-0003174351-
dc.identifier.hkuros59967-
dc.identifier.citeulike2815753-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats