Low complexity scheduling algorithms for the LTE uplink

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 pr...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Symposium on Computers and Communications pp. 266 - 270
Main Authors Yaacoub, E., Al-Asadi, H., Dawy, Z.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2009
Subjects
Online AccessGet full text
ISBN9781424446728
1424446724
ISSN1530-1346
DOI10.1109/ISCC.2009.5202296

Cover

More Information
Summary: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.
ISBN:9781424446728
1424446724
ISSN:1530-1346
DOI:10.1109/ISCC.2009.5202296