Joint relay selection and power allocation for NOMA-based multicast cognitive radio networks

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 qu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IET communications Ročník 14; číslo 13; s. 2027 - 2037
Hlavní autoři: Baidas, Mohammed W, Alsusa, Emad, Hamdi, Khairi A
Médium: Journal Article
Jazyk:angličtina
Vydáno: The Institution of Engineering and Technology 11.08.2020
Témata:
broadcasting phase
cognitive radio
computational complexity
computationally‐prohibitive complexity
concave programming
cooperation phase
cooperative communication
end‐to‐end SINR maximisation
end‐to‐end SNR maximisation
joint relay selection and power allocation
J‐RS‐PA problem
linear programming
linear programming problem
multicast communication
multi‐access systems
NOMA‐based multicast cognitive radio networks
nonconvex problem
optimal low‐complexity two‐stage relay selection and power allocation algorithm
primary TR pairs
primary transmitters
QoS constraints
quality of service
quality‐of‐service constraints
radio receivers
radio transmitters
relay networks (telecommunication)
Research Article
secondary TR pairs
secondary transmitters
telecommunication power management
transmitter‐receiver pairs
TS‐RS‐PA algorithm
linear programming problem
linear programming
J-RS-PA problem
primary transmitters
end-to-end SINR maximisation
cognitive radio
joint relay selection and power allocation
multicast communication
computationally-prohibitive complexity
multi-access systems
primary TR pairs
concave programming
relay networks (telecommunication)
optimal low-complexity two-stage relay selection and power allocation algorithm
telecommunication power management
end-to-end SNR maximisation
QoS constraints
transmitter-receiver pairs
quality of service
NOMA-based multicast cognitive radio networks
nonconvex problem
radio receivers
cooperative communication
secondary transmitters
broadcasting phase
secondary TR pairs
quality-of-service constraints
radio transmitters
cooperation phase
computational complexity
TS-RS-PA algorithm
ISSN:1751-8628, 1751-8636
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1751-8628
1751-8636
DOI:10.1049/iet-com.2019.0954