...
首页> 外文期刊>IEEE Transactions on Signal Processing >Distributed Power Control in Single-Stream MIMO Wiretap Interference Networks With Full-Duplex Jamming Receivers
【24h】

Distributed Power Control in Single-Stream MIMO Wiretap Interference Networks With Full-Duplex Jamming Receivers

机译:具有全双工干扰接收器的单流MIMO窃听干扰网络中的分布式功率控制

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

摘要

We consider a multi-link interference network that is tapped by an external eavesdropper. To conceal information from the eavesdropper, legitimate links are equipped withtransmitter-based friendly jamming(TxFJ) andreceiver-based friendly jamming(RxFJ). Each link seeks to maximize its secrecy rate by determining the best power assignment (PA) for the information, TxFJ, and RxFJ signals. Joint optimization of these parameters is a non-convex problem. Hence, we seek sub-optimal solutions. Specifically, we find a lower bound on the allocated power to TxFJ above which positive secrecy is achievable for a given link. Once positive secrecy is achieved, the secrecy rate becomes monotonically increasing in the power at the transmitter (Alice). Therefore, the rest of Alice's power is allocated to the information signal. Despite its sub-optimality, such an approach precludes the possibility of employing successive interference cancellation by the eavesdropper. The RxFJ PA of a link is adjusted using an on-off PA that depends only on the link's local channel state information (CSI). With every link following such a strategy, we model this interaction as a non-cooperative game. We derive sufficient conditions for the uniqueness of the resulting Nash equilibrium. We then propose an algorithm to implement the PA game. Lastly, we relax knowledge of eavesdropper's CSI (E-CSI) and propose a framework that is robust to unknown E-CSI. Our results indicate that this robust framework performs close to when E-CSI is fully known to legitimate links. Moreover, empirically it is shown that the secrecy sum-rate scales with the power budget of transmitters.
机译:我们考虑一个由外部窃听者窃听的多链路干扰网络。为了隐藏窃听者的信息,合法链接配有 n <斜体xmlns:mml = “ http://www.w3.org/1998/Math/MathML ” xmlns:xlink = “ http:// www .w3.org / 1999 / xlink “>基于发送方的友好干扰 n(TxFJ)和 n 基于接收者的友好干扰 n(RxFJ)。每个链路都通过确定信息,TxFJ和RxFJ信号的最佳功率分配(PA)来寻求最大化其保密率。这些参数的联合优化是一个非凸问题。因此,我们寻求次优的解决方案。具体来说,我们找到分配给TxFJ的功率的下限,在该下限之上,对于给定链路,可以实现正保密性。一旦达到正保密性,保密率就在发送器(Alice)的功率上单调增加。因此,爱丽丝的其余权力被分配给信息信号。尽管其次优,但这种方法排除了通过窃听者采用连续干扰消除的可能性。使用仅取决于链接的本地通道状态信息(CSI)的开关PA来调整链接的RxFJ PA。对于遵循这种策略的每个链接,我们都将这种互动模型化为非合作博弈。我们为产生的纳什均衡的唯一性推导了充分的条件。然后,我们提出一种算法来实现PA游戏。最后,我们放宽了对窃听者CSI(E-CSI)的了解,并提出了对未知E-CSI具有鲁棒性的框架。我们的结果表明,当合法链接完全了解E-CSI时,该健壮的框架可以发挥作用。此外,根据经验表明,保密总和率与发射机的功率预算成比例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号