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

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.