A game theoretical formulation for proportional fairness in LTE uplink scheduling

  • Authors:
  • Elias Yaacoub;Zaher Dawy

  • Affiliations:
  • Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon;Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon

  • Venue:
  • WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.