TY - GEN
T1 - A two-stage relay selection and power allocation algorithm for NOMA-based multicast cognitive radio networks
AU - Baidas, Mohammed W.
AU - Alsusa, Emad
AU - Hamdi, Khairi A.
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - In this paper, the problem of joint relay selection and power allocation (J-RS-PA) for NOMA-based multicast cognitive radio networks is considered. In particular, the aim is to simultaneously maximize the SINR/SNR of the primary and secondary transmitter-receiver (TR) pairs, subject to quality-of-service (QoS) constraints. Communication between the primary and secondary TR pairs is performed over two-phases, namely, the broadcasting phase, and the cooperation phase. In the broadcasting phase, the primary and secondary transmitters broadcast their data symbols to the intermediate relays; while in the cooperation phase, the selected relay forwards the decoded symbols to their intended receivers. However, the J-RS-PA problem happens to be non-convex (i.e. computationally-prohibitive). Alternatively, an optimal low-complexity two-stage relay selection and power allocation (TS-RS-PA) algorithm is devised, which is based on the solution of intelligent linear programming problem formulations. Simulation results are presented to validate the proposed TS-RS-PA algorithm, which has been shown to yield the optimal SINRlSNR values for the primary and secondary TR pairs in comparison to the J-RS-PA scheme, but with lower computational complexity, while satisfying QoS constraints.
AB - In this paper, the problem of joint relay selection and power allocation (J-RS-PA) for NOMA-based multicast cognitive radio networks is considered. In particular, the aim is to simultaneously maximize the SINR/SNR of the primary and secondary transmitter-receiver (TR) pairs, subject to quality-of-service (QoS) constraints. Communication between the primary and secondary TR pairs is performed over two-phases, namely, the broadcasting phase, and the cooperation phase. In the broadcasting phase, the primary and secondary transmitters broadcast their data symbols to the intermediate relays; while in the cooperation phase, the selected relay forwards the decoded symbols to their intended receivers. However, the J-RS-PA problem happens to be non-convex (i.e. computationally-prohibitive). Alternatively, an optimal low-complexity two-stage relay selection and power allocation (TS-RS-PA) algorithm is devised, which is based on the solution of intelligent linear programming problem formulations. Simulation results are presented to validate the proposed TS-RS-PA algorithm, which has been shown to yield the optimal SINRlSNR values for the primary and secondary TR pairs in comparison to the J-RS-PA scheme, but with lower computational complexity, while satisfying QoS constraints.
KW - Cognitive radio
KW - Cooperation
KW - Multi-objective
KW - Non-orthogonal multiple-access
KW - Power allocation
KW - Relay selection
UR - http://www.scopus.com/inward/record.url?scp=85075949244&partnerID=8YFLogxK
U2 - 10.1109/ISNCC.2019.8909195
DO - 10.1109/ISNCC.2019.8909195
M3 - Conference contribution
AN - SCOPUS:85075949244
T3 - 2019 International Symposium on Networks, Computers and Communications, ISNCC 2019
BT - 2019 International Symposium on Networks, Computers and Communications, ISNCC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 International Symposium on Networks, Computers and Communications, ISNCC 2019
Y2 - 18 June 2019 through 20 June 2019
ER -