MISO窃听信道中的安全干扰利用预编码：破坏性区域重定义及其有效解决方案
Secure Interference Exploitation Precoding in MISO Wiretap Channel: Destructive Region Redefinition with Efficient Solutions
摘要：
在本文中，我们专注于物理层安全的K用户多输入单输出（MISO）窃听信道中存在的恶意窃听者，我们提出了几种干扰利用（IE）预编码方案，针对不同类型的窃听者。具体而言，在一个共同的窃听者直接解码的信号和夏娃的完整的信道状态信息（CSI）的情况下，可在发射机，我们表明，所需的发射功率可以进一步降低通过重新设计的“破坏性区域”的星座符号级预编码和重新制定的功率最小化问题。我们进一步研究的SINR平衡问题与推导出的“完全破坏性区域”与完整的，统计和没有夏娃的CSI，分别，并表明，SINR平衡问题变得非凸的统计或没有夏娃的CSI。另一方面，在存在使用最大似然（ML）检测的智能窃听者的情况下，所有现有方法都不能保证安全性。为此，我们进一步提出了一个随机干扰方案（RJS）和随机预编码方案（RPS），分别。为了有效地解决引入的凸/非凸问题，我们提出了一种基于Karush-Kuhn-Tucker（KKT）条件的凸问题的迭代算法，并通过Taylor展开来处理非凸问题.仿真结果表明，所提出的方案在保密性能上均优于已有的方案，且算法的计算效率得到了显著提高。
英文摘要：
In this paper, we focus on the physical layer security for a K-user multiple-input-single-output (MISO) wiretap channel in the presence of a malicious eavesdropper, where we propose several interference exploitation (IE) precoding schemes for different types of the eavesdropper. Specifically, in the case where a common eavesdropper decodes the signal directly and Eve's full channel state information (CSI) is available at the transmitter, we show that the required transmit power can be further reduced by re-designing the `destructive region' of the constellations for symbol-level precoding and re-formulating the power minimization problem. We further study the SINR balancing problems with the derived `complete destructive region' with full, statistical and no Eve's CSI, respectively, and show that the SINR balancing problem becomes non-convex with statistical or no Eve's CSI. On the other hand, in the presence of a smart eavesdropper using maximal likelihood (ML) detection, the security cannot be guaranteed with all the existing approaches. To this end, we further propose a random jamming scheme (RJS) and a random precoding scheme (RPS), respectively. To solve the introduced convex/non-convex problems in an efficient manner, we propose an iterative algorithm for the convex ones based on the Karush-Kuhn-Tucker (KKT) conditions, and deal with the non-convex ones by resorting to Taylor expansions. Simulation results show that all proposed schemes outperform the existing works in secrecy performance, and that the proposed algorithm improves the computation efficiency significantly.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
