DocumentCode :
459691
Title :
Towards Opportunistic Fair Scheduling in Wireless Networks
Author :
Yang, Daiqin ; Shen, Dongxu ; Shao, Wenjian ; Li, Victor O K
Author_Institution :
Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong. Email: dqyang@eee.hku.hk
Volume :
11
fYear :
2006
fDate :
38869
Firstpage :
5217
Lastpage :
5221
Abstract :
Opportunistic transmission scheduling schemes improve system capacity by taking advantage of independent time varying channels in wireless networks. In the design of such scheduling schemes, the fairness criterion plays an important role in the tradeoff of total system capacity and the achievable throughput of individual users. To meet different fairness demands with a unified opportunistic scheduling scheme, in this paper, we have extended the well known opportunistic scheduling scheme PFS into ¿PFS, which satisfies arbitrary fairness demands, varying from proportional fairness to maxmin fairness, through adjusting the parameter ¿. To further improve the achievable diversity gains of ¿PFS, we extend the ¿PFS scheme into an ¿PFS-P scheme. Performances of ¿PFS and ¿PFS-P are studied and compared. As demonstrated in the simulation results, both ¿PFS and ¿PFS-P can achieve adjustable fairness criteria, varying from proportional fairness to max-min fairness. Compared with ¿PFS, ¿PFS-P achieves higher diversity gains with degraded short term performance, which is still better than the performance of PFS.
Keywords :
Algorithm design and analysis; Base stations; Diversity methods; Fading; Scheduling algorithm; Shadow mapping; Signal to noise ratio; Throughput; Tin; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2006. ICC '06. IEEE International Conference on
Conference_Location :
Istanbul
ISSN :
8164-9547
Print_ISBN :
1-4244-0355-3
Electronic_ISBN :
8164-9547
Type :
conf
DOI :
10.1109/ICC.2006.255494
Filename :
4024878
Link To Document :
بازگشت