TY - JOUR
T1 - Energy-Efficient Base Station Association and Beamforming for Multi-Cell Multiuser Systems
AU - An, Jianping
AU - Zhang, Yihao
AU - Gao, Xiaozheng
AU - Yang, Kai
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2020/4/1
Y1 - 2020/4/1
N2 - This paper investigates the joint base station (BS) association and beamforming for energy efficiency maximization in coordinated multi-cell multiuser downlink systems. In particular, we assume that only the channel distribution information is known to the BSs. The considered problem is difficult to be solved optimally due to the non-smooth and non-convex functions in the formulation. Therefore, we propose an iterative suboptimal algorithm to solve the problem efficiently based on the successive convex approximation (SCA). More specifically, the convex approximation of the original problem at each iteration can be solved efficiently by the second-order cone programming and the solution obtained by the proposed algorithm satisfies the generalized Karush-Kuhn-Tucker (KKT) conditions. To facilitate the implementation of decentralized beamforming, we transform the convex approximation problem at each iteration of the SCA into an equivalent form, which is amenable to applying the alternating direction method of multipliers (ADMM). By combining the SCA and the ADMM, a decentralized energy-efficient beamforming algorithm is proposed. Numerical results are presented to show the performance of the proposed algorithms.
AB - This paper investigates the joint base station (BS) association and beamforming for energy efficiency maximization in coordinated multi-cell multiuser downlink systems. In particular, we assume that only the channel distribution information is known to the BSs. The considered problem is difficult to be solved optimally due to the non-smooth and non-convex functions in the formulation. Therefore, we propose an iterative suboptimal algorithm to solve the problem efficiently based on the successive convex approximation (SCA). More specifically, the convex approximation of the original problem at each iteration can be solved efficiently by the second-order cone programming and the solution obtained by the proposed algorithm satisfies the generalized Karush-Kuhn-Tucker (KKT) conditions. To facilitate the implementation of decentralized beamforming, we transform the convex approximation problem at each iteration of the SCA into an equivalent form, which is amenable to applying the alternating direction method of multipliers (ADMM). By combining the SCA and the ADMM, a decentralized energy-efficient beamforming algorithm is proposed. Numerical results are presented to show the performance of the proposed algorithms.
KW - Energy efficient
KW - base station association
KW - coordinated beamforming
KW - decentralized algorithm
KW - outage probability
UR - http://www.scopus.com/inward/record.url?scp=85083423081&partnerID=8YFLogxK
U2 - 10.1109/TWC.2020.2968431
DO - 10.1109/TWC.2020.2968431
M3 - Article
AN - SCOPUS:85083423081
SN - 1536-1276
VL - 19
SP - 2841
EP - 2854
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 4
M1 - 8972927
ER -