论文标题

使用秘密通信和友好的干扰来确保大规模D2D网络

Securing Large-Scale D2D Networks Using Covert Communication and Friendly Jamming

论文作者

Feng, Shaohan, Lu, Xiao, Sun, Sumei, Niyato, Dusit, Hossain, Ekram

论文摘要

我们利用秘密沟通和友好的干扰来提出友好的干扰助理通信,并使用它来双重确保一个大规模的设备到设备(D2D)网络,以防止EavesDroppers(即监狱长)。 D2D发射机通过以下方式防御管理员:1)通过增强的秘密通信隐藏其传输,以及2)利用友好的干扰,以确保信息保密,即使发现了D2D传输。我们将看守与D2D网络(发射机和友好的干扰者)之间的战斗建模为两阶段的Stackelberg游戏。在其中,守望者是较低阶段的追随者,目的是最大程度地减少其检测错误,而D2D网络是上层阶段的领导者,旨在最大化其效用(就链接可靠性和通信安全性而言),但受到对通信隐秘性限制的限制。我们应用随机几何形状来对网络空间配置进行建模,以进行系统级研究。我们开发了一种双层优化算法,以根据连续的凸近似(SCA)方法和Rosenbrock方法搜索所提出的Stackelberg游戏的平衡。数值结果揭示了有趣的见解。我们观察到,如果没有干扰器的协助,就很难在D2D传输上实现秘密沟通。此外,我们通过将其与信息理论的保密方法进行比较,从安全的通信概率和网络实用程序进行比较,说明了提议的友好干扰助理通信的优势。

We exploit both covert communication and friendly jamming to propose a friendly jamming-assisted covert communication and use it to doubly secure a large-scale device-to-device (D2D) network against eavesdroppers (i.e., wardens). The D2D transmitters defend against the wardens by: 1) hiding their transmissions with enhanced covert communication, and 2) leveraging friendly jamming to ensure information secrecy even if the D2D transmissions are detected. We model the combat between the wardens and the D2D network (the transmitters and the friendly jammers) as a two-stage Stackelberg game. Therein, the wardens are the followers at the lower stage aiming to minimize their detection errors, and the D2D network is the leader at the upper stage aiming to maximize its utility (in terms of link reliability and communication security) subject to the constraint on communication covertness. We apply stochastic geometry to model the network spatial configuration so as to conduct a system-level study. We develop a bi-level optimization algorithm to search for the equilibrium of the proposed Stackelberg game based on the successive convex approximation (SCA) method and Rosenbrock method. Numerical results reveal interesting insights. We observe that without the assistance from the jammers, it is difficult to achieve covert communication on D2D transmission. Moreover, we illustrate the advantages of the proposed friendly jamming-assisted covert communication by comparing it with the information-theoretical secrecy approach in terms of the secure communication probability and network utility.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源