A Game Theoretical Formulation for Proportional Fairness in LTE Uplink Scheduling

Author

Yaacoub, Elias ; Dawy, Zaher

Author_Institution

Dept. of Electr. & Comput. Eng., American Univ. of Beirut, Beirut

fYear

2009

fDate

5-8 April 2009

Firstpage

1

Lastpage

5

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.

Keywords

frequency division multiple access; game theory; resource allocation; scheduling; LTE uplink scheduling; Nash bargaining solution; SCFDMA; channel aware scheduling scheme; game theoretical formulation; long term evolution; proportional fairness; resource allocation problem; round-robin scheme; single carrier frequency division multiple access; Communications Society; Frequency conversion; Frequency division multiaccess; Game theory; OFDM; Peak to average power ratio; Processor scheduling; Round robin; Scheduling algorithm; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Networking Conference, 2009. WCNC 2009. IEEE

Conference_Location

Budapest

ISSN

1525-3511

Print_ISBN

978-1-4244-2947-9

Electronic_ISBN

1525-3511

Type

conf

DOI

10.1109/WCNC.2009.4917504

Filename

4917504