Low complexity scheduling algorithms for the LTE uplink

Author

Yaacoub, Elias ; Al-Asadi, H. ; Dawy, Zaher

Author_Institution

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

fYear

2009

fDate

5-8 July 2009

Firstpage

266

Lastpage

270

Abstract

Uplink scheduling in LTE systems is considered. Two low complexity heuristic algorithms for suboptimal subcarrier allocation are proposed and compared to other algorithms in the literature. Throughput and fairness analysis of the different algorithms are performed via Monte-Carlo simulations. The proposed algorithms are utility maximizing algorithms that can be used with various utility functions. Simulations show the superiority of the proposed algorithms and that promising results can be achieved by linear complexity algorithms.

Keywords

Monte Carlo methods; computational complexity; mobile radio; scheduling; telecommunication standards; LTE uplink; Monte Carlo simulation; linear complexity algorithms; low complexity heuristic algorithm; low complexity scheduling algorithm; uplink scheduling; Algorithm design and analysis; Downlink; Heuristic algorithms; Iterative algorithms; Performance analysis; Power system modeling; Processor scheduling; Resource management; Scheduling algorithm; Throughput; SCFDMA; resource allocation; scheduling; uplink;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 2009. ISCC 2009. IEEE Symposium on

Conference_Location

Sousse

ISSN

1530-1346

Print_ISBN

978-1-4244-4672-8

Electronic_ISBN

1530-1346

Type

conf

DOI

10.1109/ISCC.2009.5202296

Filename

5202296