Iterative Resource Allocation for Maximizing Weighted Sum Min-Rate in Downlink Cellular OFDMA Systems
Iterative Resource Allocation for Maximizing Weighted Sum Min-Rate in Downlink Cellular OFDMA Systems
复制标题
DOI：
10.1109/tsp.2010.2078811
复制
发表时间：
2010-05
影响因子：
5.4
通讯作者：
Tao Wang;L. Vandendorpe
中科院分区：
文献类型：
--
作者：
Tao Wang;L. Vandendorpe
本文研究了蜂窝正交频分多址（OFDMA）系统的下行链路，其中多个基站（BS）通过集中式资源分配算法进行协调。我们解决的问题，最大化的加权和的最小用户速率（WSMR）的协调小区的总功率约束在每个BS，在联合优化协调BS的子载波和功率分配。特别地，该问题的解决方案对应于保证每个小区中的所有用户的相似速率的资源分配。提出了一种迭代算法，交替优化子载波分配和功率分配，使WSMR不断增大直至收敛。在每次迭代中，子载波分配通过求解每个小区的混合整数线性规划来更新，而功率分配通过求解具有基于对偶的数值算法的连续凸优化问题集来更新。数值实验表明了算法的有效性。
This paper considers the downlink of a cellular orthogonal frequency division multi-access (OFDMA) system, in which multiple base stations (BSs) are coordinated by a centralized resource allocation algorithm. We address the problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each BS, in terms of jointly optimizing coordinated BSs' subcarrier and power allocation. In particular, the solution of this problem corresponds to a resource allocation that guarantees similar rates to all users in each cell. An iterative algorithm is proposed to optimize the subcarrier allocation and the 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 program for each cell, while the power allocation is updated by solving a successive set of convex optimization problems with a duality-based numerical algorithm. The effectiveness of the algorithm is illustrated by numerical experiments.