首页> 外文期刊>Wireless Communications, IEEE Transactions on >Secure Resource Allocation and Scheduling for OFDMA Decode-and-Forward Relay Networks
【24h】

Secure Resource Allocation and Scheduling for OFDMA Decode-and-Forward Relay Networks

机译:OFDMA解码转发中继网络的安全资源分配和调度

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

摘要

In this paper, we formulate an optimization problem for secure resource allocation and scheduling in orthogonal frequency division multiple access (OFDMA) half-duplex decode-and-forward (DF) relay assisted networks. Our problem formulation takes into account artificial noise generation to combat a passive multiple antenna eavesdropper and the effects of imperfect channel state information at the transmitter (CSIT) in slow fading. The optimization problem is solved by dual decomposition which results in a highly scalable distributed iterative resource allocation algorithm. The packet data rate, secrecy data rate, power, and subcarrier allocation policies are optimized to maximize the average secrecy outage capacity (bit/s/Hz securely and successfully delivered to the users via relays). Simulation results illustrate that our proposed distributed iterative algorithm converges to the optimal solution in a small number of iterations and guarantees a non-zero secrecy data rate for given target secrecy outage and channel outage probability requirements.
机译:在本文中,我们为正交频分多址(OFDMA)半双工解码和转发(DF)中继辅助网络中的安全资源分配和调度提出了一个优化问题。我们的问题公式考虑了人工噪声的产生,以与无源多天线窃听者作斗争,并考虑了慢速衰落中发射机(CSIT)上不完善的信道状态信息的影响。通过双重分解解决了优化问题,这导致了高度可扩展的分布式迭代资源分配算法。分组数据速率,保密数据速率,功率和子载波分配策略已得到优化,以最大程度地提高平均保密中断容量(安全可靠地通过中继将比特/秒/赫兹传输给用户)。仿真结果表明,我们提出的分布式迭代算法在少量迭代中收敛到最优解,并在给定目标保密中断和信道中断概率要求下,保证了非零保密数据速率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号