User-Pair Selection for QoS-Aware Secrecy Rate Maximization in Untrusted NOMA

Sapna Thapar, Deepak Mishra, Ravikant Saini, Zhiguo Ding

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Non-orthogonal multiple access (NOMA) has been recognized as one of the key enabling technologies for future generation wireless networks. Sharing the same time-frequency resource among users imposes secrecy challenges in NOMA in the presence of untrusted users. This paper characterizes the impact of user-pair selection on the secrecy performance of an untrusted NOMA system. In this regard, an optimization problem is formulated to maximize the secrecy rate of the strong user while satisfying the quality of service (QoS) demands of the user with poorer channel conditions. To solve this problem, we first obtain optimal power allocation in a two-user NOMA system, and then investigate the user-pair selection problem in a more generalized four user NOMA system. Extensive performance evaluations are conducted to validate the accuracy of the proposed results and present valuable insights on the impact of various system parameters on the secrecy performance of the NOMA communication system.

Original languageBritish English
Title of host publication2022 IEEE 96th Vehicular Technology Conference, VTC 2022-Fall 2022 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665454681
DOIs
StatePublished - 2022
Event96th IEEE Vehicular Technology Conference, VTC 2022-Fall 2022 - London, United Kingdom
Duration: 26 Sep 202229 Sep 2022

Publication series

NameIEEE Vehicular Technology Conference
Volume2022-September
ISSN (Print)1550-2252

Conference

Conference96th IEEE Vehicular Technology Conference, VTC 2022-Fall 2022
Country/TerritoryUnited Kingdom
CityLondon
Period26/09/2229/09/22

Fingerprint

Dive into the research topics of 'User-Pair Selection for QoS-Aware Secrecy Rate Maximization in Untrusted NOMA'. Together they form a unique fingerprint.

Cite this