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, a 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.
翻译:本文提出了一种新颖的服务质量(Qos),它能最大限度地提高不受信任用户之间的保密性。考虑到一个基地站(BS)和两个用户,设计了一个新的解码程序,为两个用户提供安全。为了确保用户之间的保密性公平,同时满足在BS传输电力预算限制下对QS的要求,我们探讨了最大限度地减少最大保密性故障概率(SOP)的问题。获得了双胞胎出勤概率和最佳权力分配的封闭式表达(POP)以最大限度地减少持久性有机污染物。为了分析保密性表现,为两个用户提供SOP的分析表达方式,并且利用普遍共性概念解决了单个SOP的最小化问题。还找到了SOP的信号至噪音比高和微量优化解决方案的最小化。此外,从保密性公平观点获得全球最佳解决方案,低计算复杂性和近近近近接近分析性洞察。Numericalalalalal 和PAPA的准确性要求分别为55.1% 和19 %,对PA的准确性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性、最佳性PAAA的PA的PA的PA的用户之间。