DocumentCode
2407576
Title
A hierarchical proportional fair scheduler
Author
Khawam, Kinda ; Kelif, Jean-Marc
Author_Institution
GET/ENST, Telecom Paris
fYear
0
fDate
0-0 0
Lastpage
254
Abstract
In 3G wireless networks, opportunistic schedulers take advantage from the delay-tolerance of data applications to ensure that transmission occurs when radio channel conditions are most favourable. In the well-known opportunistic scheduler "proportional fair" (pf), the base station (BS) serves only one user per time slot which is optimal when the signal-to-noise ratio (SNR) scales linearly with the effective transmission rate. However, for a logarithmic relation between the channel quality and the transmission rate, scheduling one user at a time does not always result in maximum channel utilization. For that reason, we put forward in this paper a new scheduler that divides the cell into two categories, serving alternately the first one in a CDMA fashion and the second one according to the PF scheduler. The mathematical and simulation analysis provided proves that the proposed scheduler increases the overall throughput of the cell
Keywords
3G mobile communication; code division multiple access; mathematical analysis; scheduling; tolerance analysis; wireless channels; 3G wireless network; CDMA; PF scheduler; code division multiple access; delay-tolerance; hierarchical proportional fair; mathematical analysis; radio channel; simulation analysis; transmission rate; Interference; Multiaccess communication; Performance analysis; Propagation losses; Research and development; Round robin; Scheduling; Signal to noise ratio; Telecommunications; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Next Generation Internet Design and Engineering, 2006. NGI '06. 2006 2nd Conference on
Conference_Location
Valencia
Print_ISBN
0-7803-9455-0
Electronic_ISBN
0-7803-9456-9
Type
conf
DOI
10.1109/NGI.2006.1678248
Filename
1678248
Link To Document