论文标题
在存在多个Antenna对手的情况下，用于秘密交流的合作欺骗策略
A Cooperative Deception Strategy for Covert Communication in Presence of a Multi-antenna Adversary
论文作者
论文摘要
研究了一种合作欺骗策略的秘密传播，其中合作的干扰器（干扰器）试图吸引多个安德滕纳对手（威利），并降低了从发射机（爱丽丝）信号的对手接受能力。对于此策略，我们制定了一个优化问题，以最大程度地提高秘密率，当时有三种不同类型的通道状态信息（CSI）。总功率是在Alice和Jammer之间受到Kullback-Leibler（KL）差异约束的最佳分配。与现有文献不同的是，在我们提出的策略中，我们还确定了爱丽丝静音时干扰器的最佳传输能力，而现有作品始终假定干扰器的功率是固定的。具体而言，我们将S程序使用将无限约束转换为线性矩阵 - 验证（LMI）约束。当可以使用Willie的统计CSI时，我们使用渐近近似和替换方法将双重整合转换为单个集成。此外，将无干扰器欺骗的传输策略作为基准研究。最后，我们的仿真结果表明，对于拟议的策略，随着威利天线的数量，秘密率提高了。此外，与基准相比，面对不完美的CSI，我们提出的策略更加强大。
Covert transmission is investigated for a cooperative deception strategy, where a cooperative jammer (Jammer) tries to attract a multi-antenna adversary (Willie) and degrade the adversary's reception ability for the signal from a transmitter (Alice). For this strategy, we formulate an optimization problem to maximize the covert rate when three different types of channel state information (CSI) are available. The total power is optimally allocated between Alice and Jammer subject to Kullback-Leibler (KL) divergence constraint. Different from the existing literature, in our proposed strategy, we also determine the optimal transmission power at the jammer when Alice is silent, while existing works always assume that the jammer's power is fixed. Specifically, we apply the S-procedure to convert infinite constraints into linear-matrix-inequalities (LMI) constraints. When statistical CSI at Willie is available, we convert double integration to single integration using asymptotic approximation and substitution method. In addition, the transmission strategy without jammer deception is studied as a benchmark. Finally, our simulation results show that for the proposed strategy, the covert rate is increased with the number of antennas at Willie. Moreover, compared to the benchmark, our proposed strategy is more robust in face of imperfect CSI.
