In this paper, we consider maximizing the sum rate in the uplink of a multi-cell orthogonal frequency-division multiple access network. The problem has a non-convex combinatorial structure and is known to be NP-hard. Because of the inherent complexity of implementing the optimal solution, firstly, we derive an upper bound (UB) and a lower bound (LB) to the optimal average network throughput. Moreover, we investigate the performance of a near-optimal single cell resource allocation scheme in the presence of inter-cell interference, which leads to another easily computable LB. We then develop a centralized sub-optimal scheme that is composed of a geometric programming-based power control phase in conjunction with an iterative subcarrier allocation phase. Although the scheme is computationally complex, it provides an effective benchmark for low complexity schemes even without the power control phase. Finally, we propose less complex centralized and distributed schemes that are well suited for practical scenarios. The computational complexity of all schemes is analyzed, and the performance is compared through simulations. Simulation results demonstrate that the proposed low complexity schemes can achieve comparable performance with that of the centralized sub-optimal scheme in various scenarios. Moreover, comparisons with the UB and LB provide insight on the performance gap between the proposed schemes and the optimal solution. Copyright © 2011 John Wiley & Sons, Ltd.
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems
- Electrical and Electronic Engineering