Fair OFDMA Scheduling Algorithm Using Iterative Local Search with k-opt-Switches

Author

Ibing, Andreas ; Boche, Holger

Author_Institution

Heinrich-Hertz-Inst., Berlin

fYear

2008

fDate

March 31 2008-April 3 2008

Firstpage

1697

Lastpage

1702

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 max-min 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.

Keywords

OFDM modulation; minimax techniques; resource allocation; switches; 3GPP LTE; adaptive OFDMA systems; adaptive allocation; adaptive power case; combinatorial solution space; constant allocation; different scheduling; fair OFDMA scheduling algorithm; iterative algorithm; iterative local search; k-opt switches; k-opt-switches; max-min fairness; multiuser fair scheduling problem; resource blocks; subcarriers blocks; Adaptive scheduling; Communications Society; DSL; Frequency conversion; Iterative algorithms; Lagrangian functions; Mobile communication; Optimal scheduling; Scheduling algorithm; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Las Vegas, NV

ISSN

1525-3511

Print_ISBN

978-1-4244-1997-5

Type

conf

DOI

10.1109/WCNC.2008.303

Filename

4489334