...
首页> 外文期刊>IEEE Transactions on Communications >Achievable Ergodic Secrecy Rate in Bursty Interference Channels With Opportunistic User Scheduling
【24h】

Achievable Ergodic Secrecy Rate in Bursty Interference Channels With Opportunistic User Scheduling

机译:具有机会用户调度的突发干扰信道中可达到的遍历保密率

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

摘要

This paper studies secure transmissions in a bursty interference channel constructed by opportunistic user scheduling. To improve the physical layer security, we propose a signal-to-noise-plus-interference ratio (SINR) based opportunistic transmission scheme and mathematically analyze the ergodic secrecy rate per transmitter-receiver pair. In this scheme, a subset among K transmitter-receiver pairs is selected opportunistically, but each transmitter determines its activation state based on limited feedback of the SINR from its designated receiver only, without any information from other transmitters. For comparison, we also analyze the ergodic secrecy rates per transmitter-receiver pair for two benchmark schemes: non-opportunistic transmission and random transmission. Using derived analytical expressions, the achievable ergodic secrecy rates per transmitter-receiver pair are obtained by optimizing the activation probability for each scheme. To solve the non-convex optimization problem, we first show that the objective function is a sum of quasi-concave functions. Then, leveraging this fact, we propose a two-level iterative algorithm based on the damped Newton method. Furthermore, asymptotic behaviors of the achievable ergodic secrecy rate per transmitter-receiver pair are analyzed to offer insights behind the mathematical expressions. Our analytical and numerical results exhibit the gain of the proposed SINR based opportunistic transmission scheme compared to the benchmark schemes.
机译:本文研究了机会用户调度在突发干扰信道中的安全传输。为了提高物理层的安全性,我们提出了一种基于信噪比(SINR)的机会传输方案,并通过数学方法分析了每对收发器的遍历保密率。在该方案中,机会地选择了K个发送器-接收器对中的子集,但是每个发送器仅基于来自其指定接收器的SINR的有限反馈来确定其激活状态,而没有来自其他发送器的任何信息。为了进行比较,我们还针对两种基准方案分析了每个收发器对的遍历保密率:非机会传输和随机传输。使用推导的解析表达式,可以通过优化每种方案的激活概率来获得每个收发器对可实现的遍历保密率。为了解决非凸优化问题,我们首先证明目标函数是拟凹函数的和。然后,利用这一事实,我们提出了一种基于阻尼牛顿法的两级迭代算法。此外,分析了每个收发器对可达到的遍历保密率的渐近行为,以提供有关数学表达式的见解。与基准方案相比,我们的分析和数值结果显示了所提出的基于SINR的机会传输方案的收益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号