首页> 外文期刊>Information Forensics and Security, IEEE Transactions on >Power and Subcarrier Allocation for Physical-Layer Security in OFDMA-Based Broadband Wireless Networks
【24h】

Power and Subcarrier Allocation for Physical-Layer Security in OFDMA-Based Broadband Wireless Networks

机译:基于OFDMA的宽带无线网络中物理层安全性的功率和子载波分配

获取原文
获取原文并翻译 | 示例

摘要

Providing physical-layer security for mobile users in future broadband wireless networks is of both theoretical and practical importance. In this paper, we formulate an analytical framework for resource allocation in a downlink orthogonal frequency-division multiple access (OFDMA)-based broadband network with coexistence of secure users (SUs) and normal users (NUs). The SUs require secure data transmission at the physical layer while the NUs are served with conventional best-effort data traffic. The problem is formulated as joint power and subcarrier allocation with the objective of maximizing average aggregate information rate of all NUs while maintaining an average secrecy rate for each individual SU under a total transmit power constraint for the base station. We solve this problem in an asymptotically optimal manner using dual decomposition. Our analysis shows that an SU becomes a candidate competing for a subcarrier only if its channel gain on this subcarrier is the largest among all and exceeds the second largest by a certain threshold. Furthermore, while the power allocation for NUs follows the conventional water-filling principle, the power allocation for SUs depends on both its own channel gain and the largest channel gain among others. We also develop a suboptimal algorithm to reduce the computational cost. Numerical studies are conducted to evaluate the performance of the proposed algorithms in terms of the achievable pair of information rate for NU and secrecy rate for SU at different power consumptions.
机译:在未来的宽带无线网络中为移动用户提供物理层安全性在理论上和实践上都很重要。在本文中,我们为安全性用户(SU)和普通用户(NU)并存的基于下行链路正交频分多址(OFDMA)的宽带网络中的资源分配制定了一个分析框架。 SU需要在物理层进行安全的数据传输,而NU需要使用常规的尽力而为的数据流量。该问题被表述为联合功率和子载波分配,其目的是在基站的总发射功率约束下,在维持每个单独的SU的平均保密率的同时,最大化所有NU的平均集合信息速率。我们使用对偶分解以渐近最优的方式解决了这个问题。我们的分析表明,仅当SU在该子载波上的信道增益在所有子载波中最大并且超过第二大载波某个阈值时,它才成为竞争子载波的候选者。此外,尽管用于NU的功率分配遵循传统的注水原理,但是用于SU的功率分配取决于其自身的信道增益和最大的信道增益。我们还开发了次优算法来降低计算成本。进行了数值研究,以根据在不同功耗下可实现的NU信息速率和SU保密速率对评估算法的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号