Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.