Journal of Xidian University

Previous Articles     Next Articles

Adaptive proportional fair scheduling with global-fairness

LI Zhao;JIA Wenhao;BAI Yujiao   

  1. (State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071, China)
  • Received:2017-01-08 Online:2018-02-20 Published:2018-03-23


Conventional proportional fair (PF) scheduling achieves fairness at the cost of the system's rate performance. Such fairness is characterized by long-term, and hence cannot guarantee the fairness of subscribers who enter the system temporarily or stay for just a short period of time. In addition, the delay requirement of real-time service users can hardly be met. In order to remedy the above problems, we propose an adaptive proportional fair (APF) scheduling algorithm with global-fairness. The base station dynamically adjusts the forgetting factor in the PF algorithm based on the degree of dispersion of all the users' scheduling priorities so as to influence the update of users' scheduling weights. Simulation results show that compared to conventional PF scheduling, the APF can achieve both the long-term and short-term fairness and high system sum-rate, and additionally guarantee good delay performance for users' service.

Key words: user scheduling, proportional fair, adaptive, time delay