TY - JOUR
T1 - Energy-efficient resource allocation and power control for downlink multi-cell OFDMA networks
AU - Gao, Xiaozheng
AU - Yang, Kai
AU - Wu, Jinsong
AU - Zhang, Yihao
AU - An, Jianping
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017
Y1 - 2017
N2 - In this paper, we propose an energy-efficient joint resource allocation and power control scheme for downlink multi-cell orthogonal frequency division multiple access (OFDMA) networks with imperfect channel state information (CSI). Considering the maximum allowed transmit power, the tolerable outage probability, and the fact that each resource block is allocated to at most one user in each cell, we formulate the energy-efficient joint resource allocation and power control problem as a probabilistic mixed non-convex fractional programming problem, which is hard to be tackled. In order to solve the problem efficiently, we first substitute the probabilistic constraints into the objective function and then introduce new auxiliary variables to transform the original problem into a difference of two convex functions (D.C.) programming problem. As a result, we resort to D.C. algorithm to obtain a solution satisfying Karush-Kuhn-Tucker conditions of the D.C. problem. Simulation results are presented to demonstrate the effectiveness of the proposed scheme.
AB - In this paper, we propose an energy-efficient joint resource allocation and power control scheme for downlink multi-cell orthogonal frequency division multiple access (OFDMA) networks with imperfect channel state information (CSI). Considering the maximum allowed transmit power, the tolerable outage probability, and the fact that each resource block is allocated to at most one user in each cell, we formulate the energy-efficient joint resource allocation and power control problem as a probabilistic mixed non-convex fractional programming problem, which is hard to be tackled. In order to solve the problem efficiently, we first substitute the probabilistic constraints into the objective function and then introduce new auxiliary variables to transform the original problem into a difference of two convex functions (D.C.) programming problem. As a result, we resort to D.C. algorithm to obtain a solution satisfying Karush-Kuhn-Tucker conditions of the D.C. problem. Simulation results are presented to demonstrate the effectiveness of the proposed scheme.
UR - http://www.scopus.com/inward/record.url?scp=85046342635&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2017.8254199
DO - 10.1109/GLOCOM.2017.8254199
M3 - Conference article
AN - SCOPUS:85046342635
SN - 2334-0983
VL - 2018-January
SP - 1
EP - 6
JO - Proceedings - IEEE Global Communications Conference, GLOBECOM
JF - Proceedings - IEEE Global Communications Conference, GLOBECOM
T2 - 2017 IEEE Global Communications Conference, GLOBECOM 2017
Y2 - 4 December 2017 through 8 December 2017
ER -