Secrecy Fairness Aware NOMA for Untrusted Users
Sapna Thapar, Deepak Mishra, and Ravikant Saini

TL;DR
This paper proposes a novel secure NOMA protocol for untrusted users that maximizes secrecy fairness through optimized power allocation, providing analytical insights and significant performance gains over existing methods.
Contribution
It introduces a new decoding order and power allocation scheme for secure NOMA with untrusted users, enhancing secrecy fairness and analytical understanding.
Findings
Achieved about 55% to 69% improvements in secrecy fairness metrics.
Derived closed-form SOP expressions for both users.
Developed low-complexity globally-optimized power control solutions.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
