Wireless Covert Communication with Polarization Dirty Constellation

被引:1
|
作者
Hu, Mingyu [1 ]
Qiao, Sen [1 ]
Ji, Xiaopeng [1 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Sch Elect & Informat Engn, Nanjing 210044, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2023年 / 13卷 / 06期
基金
中国国家自然科学基金;
关键词
covert communication; polar codes; dirty constellation; successive cancellation decoding; successive cancellation list decoding; LIMITS;
D O I
10.3390/app13063451
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Wireless covert communication is an emerging communication technique that prevents eavesdroppers. This paper presents a novel approach to wireless covert communication based on polar codes with dirty constellation polarization. The feasibility of dirty constellation polarization is analyzed, and the impact of covert transmission power on undetectability is investigated. We polarize the covert channel and decode the covert information using a successive-cancellation decoder. Simulation results demonstrate that polar codes can significantly improve the undetectability and reliability of covert communication when compared to BCH codes. Additionally, we find that polarized covert channels achieve better undetectability and reliability when using a successive-cancellation list decoder. The proposed algorithm shows significant improvement in the undetectability and reliability of wireless covert communication with dirty constellations. This research provides a promising direction for future development in the field of covert communication, with potential applications in secure communication systems.
引用
收藏
页数:17
相关论文
共 50 条
  • [41] Tradeoffs in Covert Wireless Communication with a Controllable Full-Duplex Receiver
    Yue Zhao
    Zan Li
    Danyang Wang
    Nan Cheng
    China Communications, 2022, 19 (05) : 87 - 101
  • [42] On Mobile Covert Communication in Wireless Networks with a Full-Duplex Receiver
    Miao, Qifeng
    Cao, Yizhi
    Sun, Ranran
    He, Ji
    Li, Xiaochen
    Wu, Huihui
    2024 INTERNATIONAL CONFERENCE ON NETWORKING AND NETWORK APPLICATIONS, NANA 2024, 2024, : 215 - 221
  • [43] Tradeoffs in Covert Wireless Communication with a Controllable Full-Duplex Receiver
    Zhao, Yue
    Li, Zan
    Wang, Danyang
    Cheng, Nan
    CHINA COMMUNICATIONS, 2022, 19 (05) : 87 - 101
  • [44] Improper Gaussian Signaling Based Covert Wireless Communication in IoT Networks
    Wang, Danyang
    Fu, Qifan
    Si, Jiangbo
    Zhang, Ning
    Li, Zan
    2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [45] On Covert Communication Performance With Outdated CSI in Wireless Greedy Relay Systems
    Bai, Jiaqing
    He, Ji
    Chen, Yanping
    Shen, Yulong
    Jiang, Xiaohong
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2022, 17 : 2920 - 2935
  • [46] Covert Transmission in Water-to-Air Optical Wireless Communication Systems
    Hu, Qingqing
    Lin, Tianrui
    Wei, Tianjian
    Huang, Nuo
    Zhu, Yi-Jun
    Gong, Chen
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2024, 19 : 4432 - 4447
  • [47] Covert Communication for Wireless Networks with Full-Duplex Multiantenna Relay
    Yang, Ling
    Yang, Weiwei
    Tang, Liang
    Tao, Liwei
    Lu, Xingbo
    He, Zhengyun
    COMPLEXITY, 2022, 2022
  • [48] Covert Communication for UAV-Assisted Wireless Systems with Probabilistic Jamming
    Tian, Linying
    Gao, Chan
    Zheng, Dong
    Zhao, Qiuxia
    Shi, Yu
    2024 INTERNATIONAL CONFERENCE ON NETWORKING AND NETWORK APPLICATIONS, NANA 2024, 2024, : 222 - 228
  • [49] Optimal Probabilistic Constellation Shaping for Covert Communications
    Ma, Shuai
    Zhang, Yunqi
    Sheng, Haihong
    Li, Hang
    Shi, Jia
    Yang, Long
    Wu, Youlong
    Al-Dhahir, Naofal
    Li, Shiyin
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2022, 17 : 3165 - 3178
  • [50] Frequency and Polarization Reconfigurable Antenna for Wireless Communication
    Dhanade, Yuvraj Baburao
    Choukiker, Yogesh Kumar
    2017 INTERNATIONAL CONFERENCE OF ELECTRONICS, COMMUNICATION AND AEROSPACE TECHNOLOGY (ICECA), VOL 1, 2017, : 287 - 290