Observing the significance of spectrally-efficient secure non-orthogonal multiple access (NOMA), this paper proposes a novel quality of service (QoS) aware secure NOMA protocol that maximizes secrecy fairness among untrusted users. Considering a base station (BS) and two users, a novel decoding order is designed that provides security to both users. With the objective of ensuring secrecy fairness between users, while satisfying their QoS requirements under BS transmit power budget constraint, we explore the problem of minimizing the maximum secrecy outage probability (SOP). Closed-form expression of pair outage probability (POP) and optimal power allocation (PA) minimizing POP are obtained. To analyze secrecy performance, analytical expressions of SOP for both users are derived, and individual SOP minimization problems are solved using concept of generalized-convexity. High signal-to-noise ratio approximation of SOP and asymptotically optimized solution minimizing this approximation is also found. Furthermore, global-optimal solution from secrecy fairness standpoint is obtained at low computational complexity, and tight approximation is derived to get analytical insights. Numerical results present useful insights on globally optimized PA which ensure secrecy fairness and provide performance gain of about 55.12%, 69.30%, and 19.11%, respectively, compared to fixed PA and individual users' optimal PAs. Finally, a tradeoff between secrecy fairness performance and QoS demands is presented.
Spectrally-efficient secure non-orthogonal multiple access (NOMA) has recently attained a substantial research interest for fifth generation development. This work explores crucial security issue in NOMA which is stemmed from utilizing the decoding concept of successive interference cancellation. Considering untrusted users, we design a novel secure NOMA transmission protocol to maximize secrecy fairness among users. A new decoding order for two users' NOMA is proposed that provides positive secrecy rate to both users. Observing the objective of maximizing secrecy fairness between users under given power budget constraint, the problem is formulated as minimizing the maximum secrecy outage probability (SOP) between users. In particular, closed-form expressions of SOP for both users are derived to analyze secrecy performance. SOP minimization problems are solved using pseudoconvexity concept, and optimized power allocation (PA) for each user is obtained. Asymptotic expressions of SOPs, and optimal PAs minimizing these approximations are obtained to get deeper insights. Further, globally-optimized power control solution from secrecy fairness perspective is obtained at a low computational complexity and, asymptotic approximation is obtained to gain analytical insights. Numerical results validate the correctness of analysis, and present insights on optimal solutions. Finally, we present insights on global-optimal PA by which fairness is ensured and gains of about 55.12%, 69.30%, and 19.11%, respectively are achieved, compared to fixed PA and individual users' optimal PAs.
The amalgamation of non-orthogonal multiple access (NOMA) and physical layer security is a significant research interest for providing spectrally-efficient secure fifth-generation networks. Observing the secrecy issue among multiplexed NOMA users, which is stemmed from successive interference cancellation based decoding at receivers, we focus on safeguarding untrusted NOMA. Considering the problem of each user's privacy from each other, the appropriate secure decoding order and power allocation (PA) for users are investigated. Specifically, a decoding order strategy is proposed which is efficient in providing positive secrecy at all NOMA users. An algorithm is also provided through which all the feasible secure decoding orders in accordance with the proposed decoding order strategy can be obtained. Further, in order to maximize the sum secrecy rate of the system, the joint solution of decoding order and PA is obtained numerically. Also, a sub-optimal decoding order solution is proposed. Lastly, numerical results present useful insights on the impact of key system parameters and demonstrate that average secrecy rate performance gain of about 27 dB is obtained by the jointly optimized solution over different relevant schemes.
Non-orthogonal multiple access (NOMA) serves multiple users simultaneously via the same resource block by exploiting superposition coding at the transmitter and successive interference cancellation (SIC) at the receivers. Under practical considerations, perfect SIC may not be achieved. Thus, residual interference (RI) occurs inevitably due to imperfect SIC. In this work, we first propose a novel model for characterizing RI to provide a more realistic secrecy performance analysis of a downlink NOMA system under imperfect SIC at receivers. In the presence of untrusted users, NOMA has an inherent security flaw. Therefore, for this untrusted users' scenario, we derive new analytical expressions of secrecy outage probability (SOP) for each user in a two-user untrusted NOMA system by using the proposed RI model. To further shed light on the obtained results and obtain a deeper understanding, a high signal-to-noise ratio approximation of the SOPs are also obtained. Lastly, numerical investigations are provided to validate the accuracy of the desired analytical results and present valuable insights into the impact of various system parameters on the secrecy rate performance of the secure NOMA communication system.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.