In the Internet-of-Things (IoT), massive sensitive and confidential information is transmitted wirelessly, making security a serious concern. This is particularly true when technologies, such as non-orthogonal multiple access (NOMA), are used, making it possible for users to access each other's data. This paper studies secure communications in multiuser NOMA downlink systems, where each user is potentially an eavesdropper. Resource allocation is formulated to achieve the maximum sum secrecy rate, meanwhile satisfying the users' data requirements and power constraint. We solve this non-trivial, mixed-integer non-linear programming problem by decomposing it into power allocation with a closed-form solution, and user pairing obtained effectively using linear programming relaxation and barrier algorithm. These subproblems are solved iteratively until convergence, with the convergence rate rigorously analyzed. Simulations demonstrate that our approach outperforms its existing alternatives significantly in the sum secrecy rate and computational complexity.
翻译:在互联网上,大量敏感和机密信息是无线传输的,使安全成为一个严重问题。当使用技术,例如非横向多重访问(NOMA),使用户能够相互访问对方的数据时,尤其如此。本文研究的是多用户NOMA下行链路系统中的通信安全,每个用户都有可能是一个窃听器。资源配置是为了达到最高总和保密率,同时满足用户的数据要求和权力限制。我们通过将它分解成封闭式的配电解决方案和用户利用线性编程放松和屏障算法有效地配对,解决了这个非三进制混合非线性非线性编程问题。这些子问题是反复解决的,直到对趋同率进行严格分析。模拟表明我们的方法在总保密率和计算复杂度方面大大超越了现有的替代方法。