A Game Theoretical Formulation for Proportional Fairness in LTE Uplink Scheduling

Uplink scheduling in LTE systems is considered. A game theoretical formulation is derived where the scheduling problem is represented as a Nash bargaining solution. An algorithm to implement the proposed scheduling scheme is presented. Throughput and fairness analysis are performed via simulations. Results show that channel aware scheduling schemes outperform the round-robin scheme, but a tradeoff must be made between the increase of total throughput and fairness towards the different users.