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

被引:17
作者
Feng, Shaohan [1 ]
Lu, Xiao [2 ]
Sun, Sumei [3 ]
Niyato, Dusit [4 ]
Hossain, Ekram [5 ]
机构
[1] Zhejiang Gongshang Univ, Sussex Artificial Intelligence Inst, Sch Informat & Elect Engn, Hangzhou 310018, Peoples R China
[2] Ericsson Canada Inc, Kanata, ON K2K 2V6, Canada
[3] ASTAR, Inst Infocomm Res I2R, Singapore 138632, Singapore
[4] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore 639798, Singapore
[5] Univ Manitoba, Dept Elect & Comp Engn, Winnipeg, MB R3T 5V6, Canada
关键词
Large-scale D2D network; covert communication; physical-layer security; friendly jamming; Stackelberg game; successive convex approximation; CELLULAR NETWORKS; ENERGY;
D O I
10.1109/TWC.2023.3280464
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:592 / 606
页数:15
相关论文
共 33 条
[11]   On Covert Communication With Noise Uncertainty [J].
He, Biao ;
Yan, Shihao ;
Zhou, Xiangyun ;
Lau, Vincent K. N. .
IEEE COMMUNICATIONS LETTERS, 2017, 21 (04) :941-944
[12]   Spatial Throughput of Mobile Ad Hoc Networks Powered by Energy Harvesting [J].
Huang, Kaibin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (11) :7597-7612
[13]   Jamming Aided Covert Communication With Multiple Receivers [J].
Huang, Ke-Wen ;
Deng, Hao ;
Wang, Hui-Ming .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (07) :4480-4494
[14]  
Iellamo S, 2018, 2018 3RD CLOUDIFICATION OF THE INTERNET OF THINGS (CIOT)
[15]   Random Access Analysis for Massive IoT Networks Under a New Spatio-Temporal Model: A Stochastic Geometry Approach [J].
Jiang, Nan ;
Deng, Yansha ;
Kang, Xin ;
Nallanathan, Arumugam .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (11) :5788-5803
[16]  
Leader J., 2004, Numerical Analysis and Scientific Computation
[17]   Energy Detection Threshold Optimization For Cooperative Spectrum Sensing [J].
Liu, Yixian ;
Zeng, Chunyan ;
Wang, Hongjiang ;
Wei, Gang .
2ND IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER CONTROL (ICACC 2010), VOL. 4, 2010, :566-570
[18]  
Liu Z., 2018, IEEE INT C COMMUNICA, P1
[19]   Stochastic Geometry Analysis of Spatial-Temporal Performance in Wireless Networks: A Tutorial [J].
Lu, Xiao ;
Salehi, Mohammad ;
Haenggi, Martin ;
Hossain, Ekram ;
Jiang, Hai .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2021, 23 (04) :2753-2801
[20]   Intelligent Reflecting Surface Enabled Covert Communications in Wireless Networks [J].
Lu, Xiao ;
Hossain, Ekram ;
Shafique, Taniya ;
Feng, Shaohan ;
Jiang, Hai ;
Niyato, Dusit .
IEEE NETWORK, 2020, 34 (05) :148-155