TY - GEN
T1 - Sum rate maximization in the uplink of multi-cell OFDMA networks
AU - Tabassum, Hina
AU - Alouini, Mohamed-Slim
AU - Dawy, Zaher
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2011/9/12
Y1 - 2011/9/12
N2 - Resource allocation in orthogonal frequency division multiple access (OFDMA) networks plays an imperative role to guarantee the system performance. However, most of the known resource allocation schemes are focused on maximizing the local throughput of each cell, while ignoring the significant effect of inter-cell interference. This paper investigates the problem of resource allocation (i.e., subcarriers and powers) in the uplink of a multi-cell OFDMA network. The problem has a non-convex combinatorial structure and is known to be NP hard. Firstly, we investigate the upper and lower bounds to the average network throughput due to the inherent complexity of implementing the optimal solution. Later, a centralized sub-optimal resource allocation scheme is developed. We further develop less complex centralized and distributed schemes that are well-suited for practical scenarios. The computational complexity of all schemes has been analyzed and the performance is compared through numerical simulations. Simulation results demonstrate that the distributed scheme achieves comparable performance to the centralized resource allocation scheme in various scenarios. © 2011 IEEE.
AB - Resource allocation in orthogonal frequency division multiple access (OFDMA) networks plays an imperative role to guarantee the system performance. However, most of the known resource allocation schemes are focused on maximizing the local throughput of each cell, while ignoring the significant effect of inter-cell interference. This paper investigates the problem of resource allocation (i.e., subcarriers and powers) in the uplink of a multi-cell OFDMA network. The problem has a non-convex combinatorial structure and is known to be NP hard. Firstly, we investigate the upper and lower bounds to the average network throughput due to the inherent complexity of implementing the optimal solution. Later, a centralized sub-optimal resource allocation scheme is developed. We further develop less complex centralized and distributed schemes that are well-suited for practical scenarios. The computational complexity of all schemes has been analyzed and the performance is compared through numerical simulations. Simulation results demonstrate that the distributed scheme achieves comparable performance to the centralized resource allocation scheme in various scenarios. © 2011 IEEE.
UR - http://hdl.handle.net/10754/246792
UR - http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5982703
UR - http://www.scopus.com/inward/record.url?scp=80052491271&partnerID=8YFLogxK
U2 - 10.1109/IWCMC.2011.5982703
DO - 10.1109/IWCMC.2011.5982703
M3 - Conference contribution
SN - 9781424495399
SP - 1152
EP - 1157
BT - 2011 7th International Wireless Communications and Mobile Computing Conference
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -