Asymptotically Fair Transmission Scheduling over Fading Channels
2004 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 3, no 1, 326-336 p.Article in journal (Refereed) Published
In this work, the problem of scheduling delay insensitive data over a DS-CDMA downlink fading channel is considered. We consider the case where only one user at a time is allowed to transmit. As the channels can be considered to vary asynchronously among the users, multiuser diversity gains can be obtained by exploiting channel adaptive scheduling. For this, schedulers of different adaptation rate are suggested and compared. In particular we analyze a simple fast scheduler that schedules a user to transmit when its channel is good relative to its mean. This scheduler is resource fair in the sense it can provide the users with the same asymptotical channel access. We show that the achievable scheduling gain compared to round robin is equal to the gain of a selection diversity scheme. The scheduling gain is determined, both on closed-form and by numerical integration, for several scenarios, including multicellular systems and the effect of time delayed channel estimates. The results show that the scheduling gain is larger for channels with low average quality.
Place, publisher, year, edition, pages
IEEE , 2004. Vol. 3, no 1, 326-336 p.
Computer and Information Science
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-27794DOI: 10.1109/TWC.2003.821147ISI: 000188260600034ScopusID: 2-s2.0-2342472624OAI: oai:DiVA.org:kth-27794DiVA: diva2:382586
QC 20110105. 56th IEEE Vehicular Technology Conference. VANCOUVER, CANADA. SEP 24-28, 2002 2011-01-022011-01-022011-10-24Bibliographically approved