Expected throughput of the proportional fair scheduling over Rayleigh fading channels

摘要

Existing analytical work on the proportional fair scheduling (PFS) algorithm has some limitations: 1) it requires independent identically distributed (i.i.d) relationship among users, 2) it uses a modified version of preference metric different from the original one, and 3) it is only valid for single-input-single-output (SISO) communications. This letter presents an analytical expression for the expected throughput of PFS over Rayleigh fading channels without the limitations above. The derived expression can be easily evaluated, and applies to both SISO and multiple-input-multiple-output (MIMO) cases. In addition, existing analytic result can be derived by using our expression in corresponding scenarios.