On the Energy Efficiency Maximization of NOMA-Aided Downlink Networks With Dynamic User Pairing

This study investigates a combined system comprising non-orthogonal multiple access (NOMA) and beamforming in a downlink network. To fully exploit the advantages of NOMA, user (UE) pairing and beamforming design are jointly optimized via a generalized model for UE association, subject to energy effi...

Full description

Saved in:
Bibliographic Details
Published inIEEE access Vol. 10; pp. 35131 - 35145
Main Authors Nguyen, Kha-Hung, Nguyen, Hieu V., P. Le, Mai T., Sanguinetti, Luca, Shin, Oh-Soon
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This study investigates a combined system comprising non-orthogonal multiple access (NOMA) and beamforming in a downlink network. To fully exploit the advantages of NOMA, user (UE) pairing and beamforming design are jointly optimized via a generalized model for UE association, subject to energy efficiency maximization. Owing to the combination of binary variables and nonconvex constraints, the resulting optimization problem belongs to the class of mixed-integer nonconvex programming. An innovative algorithm, integrating the inner-approximation and Dinkelbach methods, is proposed herein to address a nonconvex fractional function. By introducing a pairing matrix and relaxing the binary variables into continuous ones, our approach is capable of reaching an optimal solution, where two arbitrary UEs are optimally paired regardless of geographical or spatial constraints. For practical scenarios, we further propose a robust design to manage the effect of channel estimation errors under settings involving channel uncertainty. Numerical results show that our proposed designs, even with the presence of the imperfect channel state information at the base station, significantly outperform the conventional beamforming and existing pairing schemes.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2022.3162875