TY - JOUR
T1 - Joint subcarrier assignment and weighted-sum energy-efficient power allocation in multi-carrier uplink NOMA relay networks
AU - Baidas, Mohammed W.
AU - Alsusa, Emad
AU - Hamdi, Khairi A.
N1 - Publisher Copyright:
© 2019 Elsevier B.V.
PY - 2019/10
Y1 - 2019/10
N2 - In this paper, the problem of joint subcarrier assignment and weighted-sum energy-efficient power allocation (J-SA-WSEE-PA) in multi-carrier uplink NOMA relay networks is considered. Specifically, the aim is to assign subcarriers to network users, while maximizing the weighted-sum energy-efficiency, subject to quality-of-service (QoS) constraints. The J-SA-WSEE-PA problem is shown to be non-convex, and thus is computationally-expensive. In turn, it is split into two sub-problems: (1) WSEE maximizing power allocation per subcarrier, and (2) matching-theoretic subcarrier assignment. For the first sub-problem, a low-complexity iterative solution procedure is devised to optimally solve the WSEE-maximizing power allocation problem per subcarrier. As for the second sub-problem, two linear time-complexity stable matching algorithms based on the hospitals–residents matching problem are proposed to assign subcarriers to network users. Simulation results are presented to validate the devised solution procedure and the proposed stable matching algorithms, where it has been shown that they yield comparable network sum energy-efficiency to the J-SA-WSEE-PA scheme, while satisfying QoS constraints, and with lower computational complexity.
AB - In this paper, the problem of joint subcarrier assignment and weighted-sum energy-efficient power allocation (J-SA-WSEE-PA) in multi-carrier uplink NOMA relay networks is considered. Specifically, the aim is to assign subcarriers to network users, while maximizing the weighted-sum energy-efficiency, subject to quality-of-service (QoS) constraints. The J-SA-WSEE-PA problem is shown to be non-convex, and thus is computationally-expensive. In turn, it is split into two sub-problems: (1) WSEE maximizing power allocation per subcarrier, and (2) matching-theoretic subcarrier assignment. For the first sub-problem, a low-complexity iterative solution procedure is devised to optimally solve the WSEE-maximizing power allocation problem per subcarrier. As for the second sub-problem, two linear time-complexity stable matching algorithms based on the hospitals–residents matching problem are proposed to assign subcarriers to network users. Simulation results are presented to validate the devised solution procedure and the proposed stable matching algorithms, where it has been shown that they yield comparable network sum energy-efficiency to the J-SA-WSEE-PA scheme, while satisfying QoS constraints, and with lower computational complexity.
KW - Energy-efficiency
KW - Matching
KW - Multi-carrier
KW - Non-orthogonal multiple-access
KW - Power allocation
KW - Subcarrier assignment
UR - http://www.scopus.com/inward/record.url?scp=85070678584&partnerID=8YFLogxK
U2 - 10.1016/j.phycom.2019.100821
DO - 10.1016/j.phycom.2019.100821
M3 - Article
AN - SCOPUS:85070678584
SN - 1874-4907
VL - 36
JO - Physical Communication
JF - Physical Communication
M1 - 100821
ER -