Recently, various wireless Internet-of-Things devices and unmanned aerial vehicles have been frequently used to facilitate daily life. On the other hand, they can also pose serious threats to public security if maliciously used. A countermeasure against these threats is to transmit jamming signals to break the communication links between attacker and wireless devices. However, this is not easy since modern multi-device (multi-user) wireless communication systems are smart in avoiding jamming. Moreover, a relay is widely used to improve the jamming resistance. To successfully jam those malicious devices, we consider a jamming and anti-jamming zero-sum game, in which the attacker tries to maximize the sum-rate of a relay-assisted wireless system and the jammer tries to minimize it. Finding the equilibrium is challenging due to its non-convexity and complex structure. We address this problem in two cases. Specifically, in the single-device (single-user) case, we show that putting the whole jamming power to either relay or device achieves the Nash equilibrium. In the multi-device case, an efficient method is developed, which transforms this game into a min-max optimization problem and decouples it into two sub-problems by the hybrid block successive approximation method. The resultant sub-problems are solved by the multi-block alternating direction method of multipliers and the block successive upper-bound minimization method of multipliers, respectively. Then, a stationary point of the original problem can be iteratively achieved. Numerical results demonstrate that the two proposed jamming methods outperform many traditional methods.

中文翻译：

---

干扰中继辅助多用户无线通信系统：零和博弈方法


近年来，各种无线物联网设备和无人机被频繁使用，方便了人们的日常生活。另一方面，如果被恶意使用，也会对公共安全构成严重威胁。针对这些威胁的对策是传输干扰信号以中断攻击者和无线设备之间的通信链路。然而，这并不容易，因为现代多设备（多用户）无线通信系统可以智能地避免干扰。此外，广泛使用继电器来提高抗干扰能力。为了成功干扰这些恶意设备，我们考虑干扰和反干扰零和博弈，其中攻击者试图最大化中继辅助无线系统的总速率，而干扰器则试图最小化它。由于其非凸性和复杂的结构，找到平衡点具有挑战性。我们分两种情况解决这个问题。具体来说，在单设备（单用户）情况下，我们表明将整个干扰功率分配给继电器或设备可以实现纳什均衡。在多设备情况下，开发了一种有效的方法，将该博弈转化为最小-最大优化问题，并通过混合块逐次逼近方法将其解耦为两个子问题。由此产生的子问题分别通过乘法器的多块交替方向法和乘法器的块连续上界最小化法来求解。然后，可以迭代地获得原始问题的驻点。数值结果表明，所提出的两种干扰方法优于许多传统方法。