arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.16463cs.ITeess.SPmath.IT
收藏

针对不可信用户的安全公平感知NOMA

Secrecy Fairness Aware NOMA for Untrusted Users

Sapna Thapar, Deepak Mishra, Ravikant Saini

摘要:

频谱高效的安全非正交多址接入(NOMA)最近获得了大量的研究兴趣,为第五代发展。这项工作探讨了NOMA中的关键安全问题,这是源于利用连续干扰消除的解码概念。考虑到不可信用户,我们设计了一种新的安全NOMA传输协议,以最大限度地提高用户之间的保密公平性。提出了一种新的两用户NOMA译码顺序,为两个用户提供正保密率。在给定的功率预算约束下,以最大化用户间的保密公平性为目标,将问题转化为最小化用户间的最大保密中断概率。特别是,推导出两个用户的SOP的封闭形式的表达式来分析保密性能。利用伪凸性概念求解SOP最小化问题,得到每个用户的最优功率分配。得到了SOP的渐近表达式,以及最小化这些近似的最优PA,以获得更深入的见解。此外,从保密公平的角度来看,全局优化的功率控制解决方案,获得了低计算复杂性,并获得渐近近似获得分析见解。数值结果验证了分析的正确性,并提出了最优解的见解。最后,我们提出的见解,全球最佳PA的公平性得到保证,分别实现约55.12%,69.30%和19.11%的收益,相比,固定PA和个人用户的最佳PA。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑