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

被引:11
作者
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 条
  • [1] [Anonymous], 2012, STOCHASTIC GEOMETRY
  • [2] Covert Communication Gains From Adversary's Ignorance of Transmission Time
    Bash, Boulat A.
    Goeckel, Dennis
    Towsley, Don
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (12) : 8394 - 8405
  • [3] Multi-Antenna Covert Communication via Full-Duplex Jamming Against a Warden With Uncertain Locations
    Chen, Xinying
    Sun, Wen
    Xing, Chengwen
    Zhao, Nan
    Chen, Yunfei
    Yu, F. Richard
    Nallanathan, Arumugam
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (08) : 5467 - 5480
  • [4] Cohen A.M., 2007, NUMERICAL METHODS LA, DOI [10.1007/978-0-387-68855-8, DOI 10.1007/978-0-387-68855-8]
  • [5] The Energy and Rate Meta Distributions in Wirelessly Powered D2D Networks
    Deng, Na
    Haenggi, Martin
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2019, 37 (02) : 269 - 282
  • [6] Mean-Field Artificial Noise Assistance and Uplink Power Control in Covert IoT Systems
    Feng, Shaohan
    Lu, Xiao
    Sun, Sumei
    Niyato, Dusit
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (09) : 7358 - 7373
  • [7] Forouzesh M., 2018, arXiv
  • [8] The Meta Distribution of the SIR in Poisson Bipolar and Cellular Networks
    Haenggi, Martin
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (04) : 2577 - 2589
  • [9] Improved Wireless Secrecy Rate using Distributed Auction Theory
    Han, Zhu
    Marina, Ninoslav
    Debbah, Merouane
    Hjorungnes, Are
    [J]. 2009 FIFTH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS, 2009, : 442 - +
  • [10] Havil J, 2003, GAMMA: EXPLORING EULERS CONSTANT, P1