首页> 外文期刊>Industrial Informatics, IEEE Transactions on >Secure Resource Allocation for OFDMA Two-Way Relay Wireless Sensor Networks Without and With Cooperative Jamming
【24h】

Secure Resource Allocation for OFDMA Two-Way Relay Wireless Sensor Networks Without and With Cooperative Jamming

机译:带有和不带有协作干扰的OFDMA两路中继无线传感器网络的安全资源分配

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

摘要

We consider secure resource allocations for orthogonal frequency division multiple access (OFDMA) two-way relay wireless sensor networks (WSNs). The joint problem of subcarrier (SC) assignment, SC pairing and power allocations, is formulated under scenarios of using and not using cooperative jamming (CJ) to maximize the secrecy sum rate subject to limited power budget at the relay station (RS) and orthogonal SC allocation policies. The optimization problems are shown to be mixed integer programming and nonconvex. For the scenario without CJ, we propose an asymptotically optimal algorithm based on the dual decomposition method and a suboptimal algorithm with lower complexity. For the scenario with CJ, the resulting optimization problem is nonconvex, and we propose a heuristic algorithm based on alternating optimization. Finally, the proposed schemes are evaluated by simulations and compared with the existing schemes.
机译:我们考虑用于正交频分多址(OFDMA)双向中继无线传感器网络(WSN)的安全资源分配。子载波(SC)分配,SC配对和功率分配的联合问题是在使用和不使用协作干扰(CJ)的情况下制定的,以最大化保密和率,而中继站(RS)的功率预算有限并且正交SC分配策略。优化问题显示为混合整数规划和非凸面。对于没有CJ的情况,我们提出了一种基于对偶分解方法的渐近最优算法和较低复杂度的次优算法。对于带有CJ的场景,所产生的优化问题是非凸的,我们提出了一种基于交替优化的启发式算法。最后,通过仿真对提出的方案进行了评估,并与现有方案进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号