Graduate School and Research Center In communication systems

A channel predictive proportional fair scheduling algorithm

Bang, Hans Jørgen; Ekman, Torbjörn;Gesbert, David

SPAWC 2005, 6th IEEE Workshop on Signal Processing Advances in Wireless Communications, June 5-8, 2005, New York City, USA

There is growing interest in the area of cross-layer design. This paper addresses the problem of multi-user diversity scheduling together with channel prediction. Recent work demonstrates that the mobile radio channel can be linearly predicted, quite accurately, several milliseconds ahead in time for realistic Doppler spreads. We show how this information can be exploited in an original fashion to improve the so-called throughput-fairness trade-off in multiuser wireless fading channel scheduling. Simulations show that the proposed algorithm can give considerable throughput gains without compromising fairness. The current approach builds on the proportional fair scheduling technique but can also be generalized to other criteria.

Document Doi Bibtex

Type:Conference
Language:English
City:New York City
Country:UNITED STATES
Date:
Department:Mobile Communications
Eurecom ref:1668
Copyright: © 2005 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.
Bibtex: @inproceedings{EURECOM+1668, doi = {http://dx.doi.org/10.1109/SPAWC.2005.1506214}, year = {2005}, title = {{A} channel predictive proportional fair scheduling algorithm}, author = {{B}ang, {H}ans {J}{\o}rgen and {E}kman, {T}orbj{\"o}rn and {G}esbert, {D}avid}, booktitle = {{SPAWC} 2005, 6th {IEEE} {W}orkshop on {S}ignal {P}rocessing {A}dvances in {W}ireless {C}ommunications, {J}une 5-8, 2005, {N}ew {Y}ork {C}ity, {USA}}, address = {{N}ew {Y}ork {C}ity, {UNITED} {STATES}}, month = {06}, url = {http://www.eurecom.fr/publication/1668} }
See also: