Resource Allocation for Maximizing Weighted Sum Min-Rate in Downlink Cellular OFDMA Systems
T. Wang, Luc Vandendorpe
Abstract
T. Wang, Luc Vandendorpe
Abstract
This paper considers the downlink of a cellular orthogonal frequency division multi-access (OFDMA) system, in which multiple base stations (BS) are coordinated by a centralized resource allocation algorithm. We address the problem of maximizing the weighted sum min-rate (WSMR) subject to a total power constraint at each BS, in terms of jointly optimizing coordinated BSs' subcarrier and power allocation. In particular, this problem leads to a resource allocation that guarantees similar rates to users in each cell. An iterative algorithm is proposed to optimize subcarrier and power allocation alternatively, so that the WSMR keeps increasing until convergence. In each iteration, the subcarrier allocation is updated by solving a mixed integer linear programming problem for each cell, while the power allocation is updated by solving a successive set of convex optimization problems with an algorithm based on Karush-KuhnTucker conditions. The effectiveness of the algorithm is illustrated by numerical experiments.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper considers the downlink of a cellular orthogonal frequency division multi-access (OFDMA) system, in which multiple base stations (BS) are coordinated by a centralized resource allocation algorithm. We address the problem of maximizing the weighted sum min-rate (WSMR) subject to a total power constraint at each BS, in terms of jointly optimizing coordinated BSs' subcarrier and power allocation. In particular, this problem leads to a resource allocation that guarantees similar rates to users in each cell. An iterative algorithm is proposed to optimize subcarrier and power allocation alternatively, so that the WSMR keeps increasing until convergence. In each iteration, the subcarrier allocation is updated by solving a mixed integer linear programming problem for each cell, while the power allocation is updated by solving a successive set of convex optimization problems with an algorithm based on Karush-KuhnTucker conditions. The effectiveness of the algorithm is illustrated by numerical experiments.
Key concepts: Subcarrier, Orthogonal frequency-division multiple access, Telecommunications link, Mathematical optimization, Computer science, Resource allocation, Base station, Frequency-division multiple access