Document Type

Journal Article

Publication Title

IEEE Transactions on Information Forensics and Security

Volume

19

First Page

5561

Last Page

5574

Publisher

IEEE

School

School of Science

RAS ID

71326

Comments

This is an Author's Accepted Manuscript of Chen, X., Gao, F., Qiu, M., Zhang, J., Shu, F., & Yan, S. (2024). Achieving Covert Communication With A Probabilistic Jamming Strategy. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/TIFS.2024.3402346

© 2024 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Abstract

In this work, we consider a covert communication scenario, where a transmitter Alice communicates to a receiver Bob with the aid of a probabilistic and uninformed jammer against an adversary warden's detection. The transmission status and power of the jammer are random and follow some priori probabilities. We first analyze the warden's detection performance as a function of the jammer's transmission probability, transmit power distribution, and Alice's transmit power. We then maximize the covert throughput from Alice to Bob subject to a covertness constraint, by designing the covert communication strategies from three different perspectives: Alice's perspective, the jammer's perspective, and the global perspective. Our analysis reveals that the minimum jamming power should not always be zero in the probabilistic jamming strategy, which is different from that in the continuous jamming strategy presented in the literature. In addition, we prove that the minimum jamming power should be the same as Alice's covert transmit power, depending on the covertness and average jamming power constraints. Furthermore, our results show that the probabilistic jamming can outperform the continuous jamming in terms of achieving a higher covert throughput under the same covertness and average jamming power constraints.

DOI

10.1109/TIFS.2024.3402346

Creative Commons License

Creative Commons Attribution-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-No Derivative Works 4.0 License.

Available for download on Wednesday, August 05, 2026

Share

 
COinS