Throughput of proportional fair scheduling over rayleigh fading channels

The proportional fair scheduling (PFS) algorithm is implemented in current 3G wireless networks for high data rate delay-tolerant services. Though the algorithm has low implementation complexity, the problem of proportional fairness is NP-hard. An analytical expression is obtained to approximate the throughput of PFS in cellular networks over Rayleigh fading channels. Comparisons against simulation results show that the expression is accurate.