Energy Efficient Power Allocation for Downlink NOMA Heterogeneous Networks With Imperfect CSI

Non-orthogonal multiple access (NOMA) is a promising emerging technology that can significantly improve the utilization of spectrum and system capacity in heterogeneous wireless networks. Power allocation plays a key role in the successful deployment of NOMA. In the most prior power allocation schem...

Full description

Bibliographic Details
Main Authors: Xin Song, Li Dong, Jingpu Wang, Lei Qin, Xiuwei Han
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8673946/
Description
Summary:Non-orthogonal multiple access (NOMA) is a promising emerging technology that can significantly improve the utilization of spectrum and system capacity in heterogeneous wireless networks. Power allocation plays a key role in the successful deployment of NOMA. In the most prior power allocation schemes, the perfect channel state information (CSI) is assumed to be known which is difficult to obtain in a realistic environment. In this paper, we propose a power allocation scheme to maximize energy efficiency for downlink NOMA heterogeneous networks based on imperfect CSI. The system model for imperfect CSI is built, in which the optimization problem is a probabilistic non-convex problem with the constraint of outage probability. To solve the optimization problem, the probabilistic problem is transformed to a non-probabilistic problem through relaxation. The power allocation for each small cell is achieved via bisection search algorithm based on gradient value, where the trend of energy efficiency as a function of the power of the small cell is analyzed. The sequential convex programming is adapted to transform the non-convex problem to a convex problem. The closed-form solutions of power allocation factors are derived by the Lagrangian multiplier method. The simulation results show the superiority and efficiency of the proposed scheme compared with the traditional algorithms.
ISSN:2169-3536