DocumentCode
2100903
Title
A novel scheduling scheme for finite buffer service in time-varying channels
Author
Fei Liu ; Wei Xiang ; Hui Zhao ; Kan Zheng ; Hang Long
Author_Institution
Wireless Signal Process. & Network Lab., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear
2012
fDate
9-11 Nov. 2012
Firstpage
36
Lastpage
40
Abstract
In this paper, a new scheduling scheme is proposed for finite buffer services in time-varying wireless channel environments. With the proportional fair (PF) principle, we propose the use of a time factor (TF) to guarantee the stability of the system as well as shortening the average user delay. The proposed PF-TF algorithm is parametrically adjustable that can be applied under different channel conditions. Simulation results suggest that the proposed scheme is able to achieve a shorter delay than conventional algorithms.
Keywords
buffer storage; delays; scheduling; wireless channels; PF-TF algorithm; average user delay; finite buffer service; novel scheduling scheme; proportional fair principle; time factor; time-varying wireless channel environments; finite buffer; proportional fair; scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Technology (ICCT), 2012 IEEE 14th International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4673-2100-6
Type
conf
DOI
10.1109/ICCT.2012.6511184
Filename
6511184
Link To Document