Title :
Scheduling with QoS constraints over Rayleigh fading channels
Author :
Eryilmaz, A. ; Srikant, R.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Champaign, IL, USA
Abstract :
We consider the problem of scheduling packets from multiple flows over a Rayleigh fading wireless channel. Recently, there has been much interest in opportunistic scheduling, i.e., scheduling packets from a user who has the highest SNR (signal-to-noise ratio), to maximize the network´s throughput. In this paper, we compare the throughput achievable under fair opportunistic scheduling (i.e., a modification of opportunistic scheduling to ensure fair resource allocation) with the throughput under time-division multiplexing (TDM) scheduling. Using large deviations to characterize the probability that the QoS constraint (an upper bound on delay) is violated, we numerically compare the performance of the two scheduling algorithms under various channel conditions. We show that the opportunistic scheduler outperforms the TDM scheduler when the number of users is small but the TDM scheduler performs better when the number of users exceeds a threshold which depends on the channel parameters.
Keywords :
Rayleigh channels; probability; quality of service; scheduling; time division multiplexing; QoS constraints; Rayleigh fading wireless channel; fair opportunistic scheduling; fair resource allocation; opportunistic scheduling; packet scheduling; signal-to-noise ratio; time-division multiplexing scheduling; Degradation; Delay; Diversity methods; Fading; Fluctuations; Quality of service; Rayleigh channels; Resource management; Throughput; Time division multiplexing;
Conference_Titel :
Decision and Control, 2004. CDC. 43rd IEEE Conference on
Print_ISBN :
0-7803-8682-5
DOI :
10.1109/CDC.2004.1429242