Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Wireless Communications and Signal Processing (WCSP)

Probabilistic Jamming Aided Covert Communication in the Finite Blocklength Regime

Ruiqian Ma, Weiwei Yang, Kaixin Cheng, Xingbo Lu

Published Nov 1, 2022• 5 citations
Publisher

Abstract

In this work, the covert communication assisted by a probabilistic jammer is investigated in the finite blocklength regime, in which the jammer emits jamming signals with a certain probability to alleviate its negative effect on legitimate link but still enhance the covertness performance. Specifically, we first derive a tractable expression of covertness constraint based on the average KL divergence. Then, a closed-form expression of average decoding error probability (DEP) involving the effect of probabilistic jamming is presented. Moreover, joint optimization of transmit power and blocklength at the transmitter for maximizing the average effective covert throughput (AECT) is formulated and tackled, which demonstrates the trade-off between the transmit power and blocklength to improve covert communication performance. Our results show that the probabilistic jamming can indeed enhance the covert communication performance, and the jamming probability can be optimized to further improve the AECT.

DOI
10.1109/wcsp55476.2022.10039177

Related papers

Achieving Covert Communication With a Probabilistic Jamming Strategy

Xun Chen, Fujun Gao, Min Qiu +3 more

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.

arXiv:2308.04278•IEEE Transactions on Information Forensics and Security•Jan 1, 2024•29 citations

Joint Relay and Jammer Selection for Covert Communication

Junhao Jiang, Weiwei Yang, Ruiqian Ma

In this paper, we investigate covert communication where the relay and the jammer are jointly selected. It is demonstrated that the improvement of covert communication performance can be achieved under the proposed maximum-and-minimum-selection (MMS) scheme. Specifically, the relay with maximal channel gain to the legitimate destination (Bob) is selected to forward the covert signal when the jammer with minimal channel gain to Bob sends artificial noise to confuse the warden (Willie). We derive the expressions of detection error probability and effective covert rate in closed-form. Based on the derivations, the transmit power of relay is optimized to further improve the covert communication performance. The simulation shows that the effective covert rate cannot always be improved by increasing the number of relay, and there exists an optimal jamming power to maximize the effective covert rate.

IEEE International Conference on Computer and Communications (ICCC)•Dec 10, 2021•16 citations

Joint Beamforming for Jammer-Aided MU-MISO Covert Communications With Finite Blocklength

Xing Lv, Manlin Wang, Zhen Ming Xu +1 more

In this work, a jammer-aided covert communication system with finite blocklength is investigated, where we propose a joint beamforming strategy of the legitimate transmitter and the friendly jammer in spatial and temporal domains. Specifically, we first derive the warder’s detection performance using a novel covertness metric. Then, an optimization problem is formulated to maximize the minimum covert rate, and a successive convex approximation-based algorithm is proposed to obtain a near-optimal solution. Numerical simulations show that our proposed joint beamforming strategy outperforms several benchmarks and achieves more realistic performance for short packet transmission than the results with infinite blocklength.

IEEE Wireless Communications Letters•Jun 26, 2025•2 citations

Covert Communication for UAV-Assisted Wireless Systems with Probabilistic Jamming

Linying Tian, Chan Gao, Dong Zheng +2 more

With the rapid development of wireless network technology, wireless communication system effectively satisfies the demand for personal communication and information acquisition. However, the significant security issue is that wireless communication is both in a complex external environment and has open space characteristics, which makes the information vulnerable to malicious attacks. In this paper, we investigate the covert performance in an unmanned aerial vehicle (UAV)-assisted wireless communication system with probabilistic jamming from a legitimate node. We propose a probabilistic jamming-based transmission scheme that uses a probabilistic approach to send an artificial noise with variable power to against the warden’s detection. For the proposed scheme, we then derive expressions for the warden’s detection error probability and covert rate. We also find the optimal covert performance under a given covertness. Finally, the simulation results are given to reveal the impact of the a priori artificial noise transmission probability on the communication covertness and the system’s performance, confirming the effectiveness of the probabilistic jamming scheme.

International Conference on Networking and Network Applications (NaNA)•Aug 9, 2024•2 citations

Relay-Assisted Finite Blocklength Covert Communications for Internet of Things

Bohang Wang, Yunyang Zhang, Rui Xu +4 more

This work investigates the problem of finite blocklength covert communications with relay assistance in Internet of Things (IoT) to extend the communications range. We reconstruct the framework for analyzing covert communications under decoded and forwarded protocols based on Willie’s optimal detection method. The analytic expression of Kullback-Leibler (KL) divergence is derived, the upper bound of KL divergence is solved by using the convexity of KL divergence, and the strict covertness constraint of the system is obtained. Meanwhile, to maximize the effective throughput, a covert communication parameter configuration scheme is proposed. Theoretical analysis and simulation results indicate that the compromised relationship of transmit power between Alice and relay nodes, and a reasonable power allocation scheme can enhance the effective throughput of the system.

IEEE Internet of Things Journal•Aug 23, 2024•12 citations

Adaptive Power Control for Cooperative Covert Communication With Partial Channel State Information

Rongrong He, Guoxin Li, Haichao Wang +2 more

In jammer-assisted covert communication scenarios, jamming signals also degrade the communication between legitimate users. Considering that it is difficult for a transmitter to obtain all the required channel state information (CSI), we propose an adaptive power control strategy with partial CSI, which decreases the outage probability while bringing more uncertainty to a warden. Specifically, we adopt an upper confidence limit to estimate the unknown CSI from the jammer to the receiver. Under warden’s optimal detector, we analyze the maximum covert throughput by optimizing the upper confidence limit. A closed-form expression of the optimized upper confidence limit is derived in certain cases. The numerical results validate the effectiveness of the proposed strategy and guide the estimation of unknown CSI.

IEEE Wireless Communications Letters•May 5, 2022•25 citations
In this work, the covert communication assisted by a probabilistic jammer is investigated in the finite blocklength regime, in which the jammer emits jamming signals with a certain probability to alleviate its negative effect on legitimate link but still enhance the covertness performance. Specifically, we first derive a tractable expression of covertness constraint based on the average KL divergence. Then, a closed-form expression of average decoding error probability (DEP) involving the effect of probabilistic jamming is presented. Moreover, joint optimization of transmit power and blocklength at the transmitter for maximizing the average effective covert throughput (AECT) is formulated and tackled, which demonstrates the trade-off between the transmit power and blocklength to improve covert communication performance. Our results show that the probabilistic jamming can indeed enhance the covert communication performance, and the jamming probability can be optimized to further improve the AECT.
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.
In this paper, we investigate covert communication where the relay and the jammer are jointly selected. It is demonstrated that the improvement of covert communication performance can be achieved under the proposed maximum-and-minimum-selection (MMS) scheme. Specifically, the relay with maximal channel gain to the legitimate destination (Bob) is selected to forward the covert signal when the jammer with minimal channel gain to Bob sends artificial noise to confuse the warden (Willie). We derive the expressions of detection error probability and effective covert rate in closed-form. Based on the derivations, the transmit power of relay is optimized to further improve the covert communication performance. The simulation shows that the effective covert rate cannot always be improved by increasing the number of relay, and there exists an optimal jamming power to maximize the effective covert rate.
In this work, a jammer-aided covert communication system with finite blocklength is investigated, where we propose a joint beamforming strategy of the legitimate transmitter and the friendly jammer in spatial and temporal domains. Specifically, we first derive the warder’s detection performance using a novel covertness metric. Then, an optimization problem is formulated to maximize the minimum covert rate, and a successive convex approximation-based algorithm is proposed to obtain a near-optimal solution. Numerical simulations show that our proposed joint beamforming strategy outperforms several benchmarks and achieves more realistic performance for short packet transmission than the results with infinite blocklength.
With the rapid development of wireless network technology, wireless communication system effectively satisfies the demand for personal communication and information acquisition. However, the significant security issue is that wireless communication is both in a complex external environment and has open space characteristics, which makes the information vulnerable to malicious attacks. In this paper, we investigate the covert performance in an unmanned aerial vehicle (UAV)-assisted wireless communication system with probabilistic jamming from a legitimate node. We propose a probabilistic jamming-based transmission scheme that uses a probabilistic approach to send an artificial noise with variable power to against the warden’s detection. For the proposed scheme, we then derive expressions for the warden’s detection error probability and covert rate. We also find the optimal covert performance under a given covertness. Finally, the simulation results are given to reveal the impact of the a priori artificial noise transmission probability on the communication covertness and the system’s performance, confirming the effectiveness of the probabilistic jamming scheme.
This work investigates the problem of finite blocklength covert communications with relay assistance in Internet of Things (IoT) to extend the communications range. We reconstruct the framework for analyzing covert communications under decoded and forwarded protocols based on Willie’s optimal detection method. The analytic expression of Kullback-Leibler (KL) divergence is derived, the upper bound of KL divergence is solved by using the convexity of KL divergence, and the strict covertness constraint of the system is obtained. Meanwhile, to maximize the effective throughput, a covert communication parameter configuration scheme is proposed. Theoretical analysis and simulation results indicate that the compromised relationship of transmit power between Alice and relay nodes, and a reasonable power allocation scheme can enhance the effective throughput of the system.
In jammer-assisted covert communication scenarios, jamming signals also degrade the communication between legitimate users. Considering that it is difficult for a transmitter to obtain all the required channel state information (CSI), we propose an adaptive power control strategy with partial CSI, which decreases the outage probability while bringing more uncertainty to a warden. Specifically, we adopt an upper confidence limit to estimate the unknown CSI from the jammer to the receiver. Under warden’s optimal detector, we analyze the maximum covert throughput by optimizing the upper confidence limit. A closed-form expression of the optimized upper confidence limit is derived in certain cases. The numerical results validate the effectiveness of the proposed strategy and guide the estimation of unknown CSI.