论文标题
编码增强的合作式秘密交流:MIMO案件
Coding-Enhanced Cooperative Jamming for Secret Communication: The MIMO Case
论文作者
论文摘要
本文考虑了具有合法发射器,合法接收器(BOB),窃听器(EVE)和合作的干扰器的高斯多输入多输出(MIMO)窃听通道。所有节点都可以配备多个天线。传统上,干扰器会传递高斯噪声(GN)以增强安全性。但是,使用这种方法,干扰信号不仅会干扰夏娃,而且会干扰鲍勃。在本文中,除了GN策略之外,我们假设干扰器还可以选择使用编码的干扰器(EJ)策略,即,而不是GN,它从适当的代码簿中传输了代码字。在某些情况下,EJ方案使Bob能够解码干扰密码字并因此取消干扰,而EVE仍然无法执行此操作,即使它知道所有代码书。我们首先在强烈的保密度量下得出了对系统保密率的内部结合,然后以计算上有效的方式考虑通过预编码器设计的最大化。在单输入多输出(SIMO)情况下,我们证明,尽管非凸,但是对于GN和EJ方案,可以最佳地解决功率控制问题。在MIMO情况下,我们建议使用矩阵同时对角线化(SD)技术解决问题,这需要相当低的计算复杂性。仿真结果表明,通过引入具有编码功能的合作干扰器,并允许其在GN和EJ方案之间切换,可以实现保密率的急剧提高。此外,根据保密率和计算时间,所提出的算法可以显着优于最新基准的当前状态。
This paper considers a Gaussian multi-input multi-output (MIMO) wiretap channel with a legitimate transmitter, a legitimate receiver (Bob), an eavesdropper (Eve), and a cooperative jammer. All nodes may be equipped with multiple antennas. Traditionally, the jammer transmits Gaussian noise (GN) to enhance the security. However, using this approach, the jamming signal interferes not only with Eve but also with Bob. In this paper, besides the GN strategy, we assume that the jammer can also choose to use the encoded jammer (EJ) strategy, i.e., instead of GN, it transmits a codeword from an appropriate codebook. In certain conditions, the EJ scheme enables Bob to decode the jamming codeword and thus cancel the interference, while Eve remains unable to do so even if it knows all the codebooks. We first derive an inner bound on the system's secrecy rate under the strong secrecy metric, and then consider the maximization this bound through precoder design in a computationally efficient manner. In the single-input multi-output (SIMO) case, we prove that although non-convex, the power control problems can be optimally solved for both GN and EJ schemes. In the MIMO case, we propose to solve the problems using the matrix simultaneous diagonalization (SD) technique, which requires quite a low computational complexity. Simulation results show that by introducing a cooperative jammer with coding capability, and allowing it to switch between the GN and EJ schemes, a dramatic increase in the secrecy rate can be achieved. In addition, the proposed algorithms can significantly outperform the current state of the art benchmarks in terms of both secrecy rate and computation time.