Fair OFDMA scheduling algorithm using iterative local search with k-opt-switches

Andreas Ibing, Holger Boche

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

An iterative algorithm for the multiuser fair scheduling problem of adaptive OFDMA systems is presented. It uses iterative local search with k-opt switches in the combinatorial solution space. The algorithm can be used with different scheduling criteria like proportional fairness and maxmin fairness, both for constant and adaptive allocation of power to subcarriers/resource blocks. The algorithm is applied to a simplified model of 3GPP LTE and its properties are simulatively investigated in the constant power and the adaptive power case.

Original languageEnglish
Title of host publicationWCNC 2008 - IEEE Wireless Communications and Networking Conference, Conference Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1697-1702
Number of pages6
ISBN (Print)9781424419968
DOIs
StatePublished - 2008
Externally publishedYes
EventIEEE Wireless Communications and Networking Conference, WCNC 2008 - Las Vegas, NV, United States
Duration: 31 Mar 20083 Apr 2008

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

ConferenceIEEE Wireless Communications and Networking Conference, WCNC 2008
Country/TerritoryUnited States
CityLas Vegas, NV
Period31/03/083/04/08

Keywords

  • Fairness
  • Iterative
  • OFDMA
  • Scheduling

Fingerprint

Dive into the research topics of 'Fair OFDMA scheduling algorithm using iterative local search with k-opt-switches'. Together they form a unique fingerprint.

Cite this