TY - JOUR
T1 - Joint relay selection and power allocation for NOMA-based multicast cognitive radio networks
AU - Baidas, Mohammed W.
AU - Alsusa, Emad
AU - Hamdi, Khairi A.
N1 - Publisher Copyright:
© The Institution of Engineering and Technology 2020
PY - 2020/8/11
Y1 - 2020/8/11
N2 - In this study, 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 maximise the end-to-end 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; while in the cooperation phase, the selected relay forwards the decoded symbols to their intended receivers. However, the formulated J-RS-PA problem happens to be non-convex, resulting in computationally-prohibitive complexity. Consequently, an optimal low-complexity two-stage relay selection and power allocation (TS-RS-PA) algorithm is devised, which is based on the solution of linear programming problem reformulations. Simulation results are presented to validate the proposed TS-RS-PA algorithm, which is shown to yield the optimal SINR/SNR values in comparison to the J-RS-PA scheme, but with lower computational complexity, while satisfying QoS constraints.
AB - In this study, 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 maximise the end-to-end 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; while in the cooperation phase, the selected relay forwards the decoded symbols to their intended receivers. However, the formulated J-RS-PA problem happens to be non-convex, resulting in computationally-prohibitive complexity. Consequently, an optimal low-complexity two-stage relay selection and power allocation (TS-RS-PA) algorithm is devised, which is based on the solution of linear programming problem reformulations. Simulation results are presented to validate the proposed TS-RS-PA algorithm, which is shown to yield the optimal SINR/SNR values in comparison to the J-RS-PA scheme, but with lower computational complexity, while satisfying QoS constraints.
UR - http://www.scopus.com/inward/record.url?scp=85087874289&partnerID=8YFLogxK
U2 - 10.1049/iet-com.2019.0954
DO - 10.1049/iet-com.2019.0954
M3 - Article
AN - SCOPUS:85087874289
SN - 1751-8628
VL - 14
SP - 2079
EP - 2083
JO - IET Communications
JF - IET Communications
IS - 13
ER -