TY - GEN
T1 - Joint Relay Selection and Energy-Efficient Power Allocation in Downlink Multi-Cell NOMA Networks
AU - Baidas, Mohammed W.
AU - Bahbahani, Zainab
AU - El-Sharkawi, Nancy
AU - Shehada, Halah
AU - Alsusa, Emad
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/4
Y1 - 2019/4
N2 - This paper considers joint relay selection and maxmin energy-efficient power allocation (J-RS-MMEE-PA) in downlink multi-cell non-orthogonal multiple-access (NOMA) networks. Particularly, the aim is to perform relay selection for each user within each cell, so as to achieve max-min energy-efficiency, while satisfying quality-of-service (QoS) constraints. However, the J-RS-MMEE-PA problem happens to be non-convex (i.e. computationally-intensive). In turn, a solution procedure for maxmin energy-efficient power allocation is devised to determine the energy-efficiency per potential relay, while meeting the target minimum rate per user. After that, the relay selection problem is modeled as a student-project allocation with preferences over projects matching problem, where a polynomial-time complexity stable matching algorithm is proposed to pair users with relays within each cell. Simulation results are presented to validate the proposed stable matching algorithm, where it is demonstrated that it efficiently yields comparable energy-efficiency per user to the J-RS-MMEE-PA scheme, while satisfying QoS constraints.
AB - This paper considers joint relay selection and maxmin energy-efficient power allocation (J-RS-MMEE-PA) in downlink multi-cell non-orthogonal multiple-access (NOMA) networks. Particularly, the aim is to perform relay selection for each user within each cell, so as to achieve max-min energy-efficiency, while satisfying quality-of-service (QoS) constraints. However, the J-RS-MMEE-PA problem happens to be non-convex (i.e. computationally-intensive). In turn, a solution procedure for maxmin energy-efficient power allocation is devised to determine the energy-efficiency per potential relay, while meeting the target minimum rate per user. After that, the relay selection problem is modeled as a student-project allocation with preferences over projects matching problem, where a polynomial-time complexity stable matching algorithm is proposed to pair users with relays within each cell. Simulation results are presented to validate the proposed stable matching algorithm, where it is demonstrated that it efficiently yields comparable energy-efficiency per user to the J-RS-MMEE-PA scheme, while satisfying QoS constraints.
KW - Energy-efficiency
KW - matching
KW - multi-cell
KW - nonorthogonal multiple-access
KW - power allocation
KW - relay selection
UR - https://www.scopus.com/pages/publications/85074777380
U2 - 10.1109/WCNC.2019.8885958
DO - 10.1109/WCNC.2019.8885958
M3 - Conference contribution
AN - SCOPUS:85074777380
T3 - IEEE Wireless Communications and Networking Conference, WCNC
BT - 2019 IEEE Wireless Communications and Networking Conference, WCNC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE Wireless Communications and Networking Conference, WCNC 2019
Y2 - 15 April 2019 through 19 April 2019
ER -