Disguised Full-Duplex Covert Communications

被引:0
|
作者
Moon, Jihwan [1 ]
机构
[1] Hanbat Natl Univ, Dept Mobile Convergence Engn, Daejeon 34158, South Korea
基金
新加坡国家研究基金会;
关键词
physical layer security; covert communications; low probability of detection; full duplex; covert rate; detection error probability; WIRELESS COMMUNICATIONS; HIDING INFORMATION; SYSTEMS;
D O I
10.3390/s23146515
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Covert communications have arisen as an effective communications security measure that overcomes some of the limitations of cryptography and physical layer security. The main objective is to completely conceal from external devices the very existence of the link for exchanging confidential messages. In this paper, we take a step further and consider a scenario in which a covert communications node disguises itself as another functional entity for even more covertness. To be specific, we study a system where a source node communicates with a seemingly receive-only destination node which, in fact, is full-duplex (FD) and covertly delivers critical messages to another hidden receiver while evading the surveillance. Our aim is to identify the achievable covert rate at the hidden receiver by optimizing the public data rate and the transmit power of the FD destination node subject to the worst-case detection error probability (DEP) of the warden. Closed-form solutions are provided, and we investigate the effects of various system parameters on the covert rate through numerical results, one of which reveals that applying more (less) destination transmit power achieves a higher covert rate when the source transmit power is low (high). Since our work provides a performance guideline from the information-theoretic point of view, we conclude this paper with a discussion on possible future research such as analyses with practical modulations and imperfect channel state information.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Delay-Constrained Covert Communications With a Full-Duplex Receiver
    Shu, Feng
    Xu, Tingzhen
    Hu, Jinsong
    Yan, Shihao
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2019, 8 (03) : 813 - 816
  • [2] Achieving Covert Wireless Communications Using a Full-Duplex Receiver
    Shahzad, Khurram
    Zhou, Xiangyun
    Yan, Shihao
    Hu, Jinsong
    Shu, Feng
    Li, Jun
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (12) : 8517 - 8530
  • [3] Full-Duplex Covert Communications Assisted by Intelligent Reflective Surfaces
    Pejoski, Slavche
    Hadzi-Velkov, Zoran
    Zlatanov, Nikola
    IEEE COMMUNICATIONS LETTERS, 2022, 26 (12) : 2846 - 2850
  • [4] Covert Rate Optimization of Millimeter Wave Full-Duplex Communications
    Wang, Chao
    Li, Zan
    Ng, Derrick Wing Kwan
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (05) : 2844 - 2861
  • [5] Covert Communications with A Full-Duplex Receiver over Wireless Fading Channels
    Hu, Jinsong
    Shahzad, Khurram
    Yan, Shihao
    Zhou, Xiangyun
    Shu, Feng
    Li, Jun
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [6] Covert Communications With a Full-Duplex Receiver in the Finite Blocklength Regime: Analysis and Optimization
    Xia, Bin
    Xu, Zhen
    Wang, Manlin
    Chen, Chunqi
    Yao, Yao
    Wang, Jiangzhou
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2024, 23 (10) : 15409 - 15420
  • [7] Covert Communications With a Full-Duplex Receiver in Non-Coherent Rayleigh Fading
    Zheng, Mengfan
    Hamilton, Alexander
    Ling, Cong
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (03) : 1882 - 1895
  • [8] FULL-DUPLEX WIRELESS COMMUNICATIONS
    Lajos Hanzo
    Chengwen Xing
    Zhongshan Zhang
    Yiqing Zhou
    中国通信, 2016, 13 (11) : 5 - 7
  • [9] FULL-DUPLEX WIRELESS COMMUNICATIONS
    Hanzo, Lajos
    Xing, Chengwen
    Zhang, Zhongshan
    Zhou, Yiqing
    China Communications, 2016, 13 (11) : IV - VI
  • [10] Multi-antenna covert communications in random wireless networks with full-duplex relay
    Liu, Yan
    Wu, Huihui
    Shen, Yulong
    Jiang, Xiaohong
    Proceedings of the ACM Symposium on Applied Computing, 2022, : 1960 - 1966