TY - GEN
T1 - Energy Efficient Hybrid Precoding in Heterogeneous Networks with Limited Wireless Backhaul Capacity
AU - Chu, Zheng
AU - Hao, Wanming
AU - Xiao, Pei
AU - Zhou, Fuhui
AU - Mi, De
AU - Zhu, Zhengyu
AU - Leung, Victor C.M.
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018
Y1 - 2018
N2 - This paper investigates a two-tier heterogeneous networks (HetNets), where millimeter wave (mmWave) frequency is employed at the macro base station (MBS), and the small cell BSs (SBSs) consider orthogonal frequency division multiple access (OFDMA). Subarray structure based hybrid analog/digital precoding scheme is studied to reduce the hardware cost and energy consumption. Our goal is to maximize the energy efficiency (EE) of the HetNets with limited wireless backhaul capacity and all users' quality of service (QoS) constraints. Due to nonconvexity of the mixed integer nonlinear fraction programming (MINLFP), the formulated problem cannot be solved directly. In order to circumvent this issue, we propose a two-loop iterative resource allocation algorithm. Specifically, we reformulate the outer-loop problem into a difference of convex programming (DCP) by employing integer relaxation and Dinkelback method. In addition, the first-order approximation is adopted to linearize this inner-loop DCP problem into a convex optimization framework. Lagrange dual method is adapted to achieve the optimal power allocation. Furthermore, the convergence of the proposed iterative algorithm is analyzed. Numerical results are presented to demonstrate our proposed algorithms.
AB - This paper investigates a two-tier heterogeneous networks (HetNets), where millimeter wave (mmWave) frequency is employed at the macro base station (MBS), and the small cell BSs (SBSs) consider orthogonal frequency division multiple access (OFDMA). Subarray structure based hybrid analog/digital precoding scheme is studied to reduce the hardware cost and energy consumption. Our goal is to maximize the energy efficiency (EE) of the HetNets with limited wireless backhaul capacity and all users' quality of service (QoS) constraints. Due to nonconvexity of the mixed integer nonlinear fraction programming (MINLFP), the formulated problem cannot be solved directly. In order to circumvent this issue, we propose a two-loop iterative resource allocation algorithm. Specifically, we reformulate the outer-loop problem into a difference of convex programming (DCP) by employing integer relaxation and Dinkelback method. In addition, the first-order approximation is adopted to linearize this inner-loop DCP problem into a convex optimization framework. Lagrange dual method is adapted to achieve the optimal power allocation. Furthermore, the convergence of the proposed iterative algorithm is analyzed. Numerical results are presented to demonstrate our proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85063478248&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2018.8647807
DO - 10.1109/GLOCOM.2018.8647807
M3 - Conference contribution
AN - SCOPUS:85063478248
T3 - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
BT - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Global Communications Conference, GLOBECOM 2018
Y2 - 9 December 2018 through 13 December 2018
ER -
