Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment

—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the constraint of proportional fairness amongst users. The proportional fair scheduling (PFS) algorithm is considered an attractive bandwidth allocation criterion in wireless networks for supporting high resource utilization while maintaining good fairness among network flows. The most challenge of a PFS problem is the lack of analytic expression. Though the PFS algorithm has been a research focus for some time, the results are mainly obtained from computer simulations. It is known that a PFS problem is NP-hard and, until recently, there are very few papers which give analytic insights into the PFS algorithm. Typically, existing works use simplified form of the PF preference metric and assume simple linear model, or the given analytic expression is valid only for very limited cases. In this research, we give analyti...

• Type: Conference
• Year: 2008
• Where: WCNC
• Authors: Erwu Liu, Kin K. Leung
• Keywords: Analytic Expressions, PFS Problem, Rayleigh Fading, WCNC 2008, Wireless Networks