Fair resource allocation under Rayleigh and/or Rician fading environments

Proportional fair scheduling (
PFS
) provides good balance between throughput and fairness via multi-user diversity and game-theoretic equilibrium. Very little analytical work exists on understanding the performance of
PFS
. Most existing prior results are for networks with Rayleigh fading. In this paper, we provide theoretical results for
PFS
in general fading environments. The results reveal that the average throughput of a user solely depends on its own channel statistics when its instantaneous data rate is
Gaussian
. Based on the theoretical results, we analyze the
PFS
performance under various scenarios with
Rayleigh
and/or
Rician
fading, and the numerical results match very well with the simulation ones. To the best of our knowledge, this work is the first one theoretically investigating the
PFS
problem in general fading environments.