TY - JOUR

T1 - Novel utility-based optimal bit-loading algorithm for orthogonal frequency division multiple access wireless networks

AU - Kooshki, H. Shamsi

AU - Navaie, Keivan

AU - Shamsi, A.

PY - 2012/9/5

Y1 - 2012/9/5

N2 - In this study, the authors propose a novel channel and queue aware algorithm for allocating power and subcarrier to users in orthogonal frequency division multiple access (OFDMA) networks. The proposed algorithm utilises a utility function to simultaneously balance and improve the efficiency and fairness of radio resource allocation. In contrast to the conventional approaches in the literature, in which it is assumed that the OFDMA system is able to support a continuous set of bit rates, here, in the system model the authors consider the fact that in practical OFDMA systems only a limited set of bit rates are supported. Furthermore, the authors do not consider the full buffer assumption and note that in practice a user scheduled for transmission might not always have data to transmit. By formulating the radio resource allocation the authors then show optimal bit loading results in a greedy algorithm that employs both bit removal and bit filling procedures. The solutions are developed in the framework of a matroid theory. The authors then analyse the average system throughput and investigate the performance of the proposed algorithm through simulations. Comparisons to similar approaches are also conducted which indicates significant performance improvement.

AB - In this study, the authors propose a novel channel and queue aware algorithm for allocating power and subcarrier to users in orthogonal frequency division multiple access (OFDMA) networks. The proposed algorithm utilises a utility function to simultaneously balance and improve the efficiency and fairness of radio resource allocation. In contrast to the conventional approaches in the literature, in which it is assumed that the OFDMA system is able to support a continuous set of bit rates, here, in the system model the authors consider the fact that in practical OFDMA systems only a limited set of bit rates are supported. Furthermore, the authors do not consider the full buffer assumption and note that in practice a user scheduled for transmission might not always have data to transmit. By formulating the radio resource allocation the authors then show optimal bit loading results in a greedy algorithm that employs both bit removal and bit filling procedures. The solutions are developed in the framework of a matroid theory. The authors then analyse the average system throughput and investigate the performance of the proposed algorithm through simulations. Comparisons to similar approaches are also conducted which indicates significant performance improvement.

KW - CROSS-LAYER OPTIMIZATION

KW - ALLOCATION ALGORITHMS

KW - RESOURCE-ALLOCATION

KW - COMMUNICATION-SYSTEMS

KW - PART I

KW - AWARE

U2 - 10.1049/iet-com.2012.0098

DO - 10.1049/iet-com.2012.0098

M3 - Journal article

VL - 6

SP - 2074

EP - 2083

JO - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 13

ER -