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

IEEE Transactions on Wireless Communications

Cognitive Jammer-Assisted MIMO Covert Communications: Analysis and Optimization

Xing Lv, Manlin Wang, Bin Xia

Published Jan 1, 2026• 0 citations
Publisher

Abstract

In multiple-input multiple-output covert communications, the joint beamforming of the legitimate transmitter (Alice) and a friendly jammer can enhance the covertness performance. However, such gains rely on instantaneous cooperation between Alice and the jammer, which could be intercepted by the warder, potentially compromising covertness. To address this issue, we consider a cognitive jammer-assisted covert communication architecture in which the jammer adapts its artificial noise transmission based on sensing Alice’s activity, without requiring real-time coordination. However, due to sensing errors, the cognitive operation produces mixed complex Gaussian observations at the warder, making the analytical characterization of covertness intractable. Consequently, the variational upper bound of the Kullback–Leibler divergence is introduced and derived as a tractable metric of covertness. Moreover, the absence of instantaneous cooperation renders centralized joint beamforming impractical. To meet this challenge, a separate optimization framework is introduced to decouple the beamforming design, and two individual algorithms based on successive convex approximation (SCA) and stochastic SCA are proposed for Alice and the jammer, respectively. Simulation results reveal that there exists an optimal antenna allocation strategy at the cognitive jammer that maximizes the covert rate, and demonstrate that the proposed cognitive jamming strategy achieves superior performance over benchmark schemes employing other jamming mechanisms, particularly in the high-power regime.

DOI
10.1109/twc.2026.3702672

Related papers

A Cooperative Deception Strategy for Covert Communication in Presence of a Multi-Antenna Adversary

Jiangbo Si, Zizhen Liu, Zan Li +4 more

Covert transmission is investigated for a cooperative deception strategy, where a cooperative jammer (Jammer) tries to attract a multi-antenna adversary (Willie) and degrade the adversary’s reception ability for the signal from a transmitter (Alice). For this strategy, we formulate an optimization problem to maximize the covert rate when three different types of channel state information (CSI) are available. The total power is optimally allocated between Alice and Jammer subject to the Kullback-Leibler (KL) divergence constraint, which can be expressed analytically and be widely used as a covertness measurement. Different from the existing literature, in our proposed strategy, we also determine the optimal transmission power at the jammer when Alice is silent, while existing works always assume that the jammer’s power is fixed. Specifically, we apply the S-procedure to convert infinite constraints into linear-matrix-inequalities (LMI) constraints. When statistical CSI at Willie is available, we convert double integration to single integration using asymptotic approximation and substitution method. Finally, our simulation results show that for the proposed strategy, the covert rate is increased with the number of antennas at Willie. Moreover, compared to the benchmark, our proposed strategy is more robust in the presence of imperfect CSI.

arXiv:2209.11171•IEEE Transactions on Communications•May 18, 2023•14 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

Multi-Antenna Jamming in Covert Communication

Ori Shmuel, Asaf Cohen, Omer Gurewitz

Covert communication conceals transmission of messages between Alice and Bob from an adversary, Willie, who tries to determine if a transmission took place or not. While covert communication in a basic, standard setting where all variables are known to Willie, results in the well-known square-root law, when a jammer is present and assists Alice by creating uncertainty in Willie's decoder, a strictly positive transmission rate is possible. In this work, we analyze the case where the jammer is equipped with multiple antennas. Specifically, we analyze the effect of multiple antennas at the jammer on Alice's transmission power and consequently on the transmission rate. We consider both the case where the channel knowledge of Willie is known as well as the case where it is unknown. We formulate several optimization problems for the transmission strategies of the jammer to maximize his assistance to Alice, in terms of maximizing Bob's received SNR and consequently the covert rate. When the channel information is known to the jammer, we show that under an achievable covertness scheme, the optimal strategy of the jammer is to perform beamforming towards a single direction with all his available power. This direction though, is not trivial, since it reflects a tradeoff point between minimizing the interference at Bob and maximizing the interference at Willie. When the channel knowledge is unknown, we show that the optimal strategy of the jammer is either to transmit isotropically to all directions or to the null-space of Bob, where this choice depends on certain channel conditions. This is in contrast to current schemes in the literature. Furthermore, we extend the optimization problems to the case where Bob is also equipped with multiple antennas, and provide insightful results, shown to be asymptotically optimal, accompanied by simulations.

arXiv:2001.03146•IEEE Transactions on Communications•Mar 19, 2021•60 citations

Jamming Antenna Selection for Covert Communication in IoT Networks With a Limited-Cooperation Jammer

Liang Fang, Pengju Yang, Zhenyang Li +1 more

Jamming antenna selection (JAS) serves as a low-complexity approach to enhance covert communication in Internet of Things (IoT) networks subject to stringent energy and computational limitations. Unlike conventional JAS strategies that assume a fully cooperative jammer selecting a single antenna for artificial noise transmission, this work investigates the optimal number of selected jamming antennas to maximize covert performance with a limited-cooperation jammer. In the considered scenario, the jammer does not provide the necessary cooperation, which prevents the legitimate receiver from acquiring the jammer–receiver channel state information (CSI). According to the degree of CSI availability at the jammer, two practical JAS schemes, random JAS (RJAS) and minimum JAS (MJAS), are investigated to effectively impair the warden’s detection performance. Closed-form expressions are derived for the warden’s expected minimum detection error probability and the legitimate receiver’s transmission outage probability, with the latter evaluated under interference-limited conditions. Leveraging these results, an optimization framework is developed to jointly determine the transmit power, transmission rate, and number of selected jamming antennas to maximize the effective covert rate. Numerical results illustrate that the effective covert rate under the RJAS strategy increases monotonically with the number of selected antennas, whereas the effective covert rate under the MJAS strategy is maximized when selecting two antennas. Both theoretical analysis and simulation results validate the effectiveness of the proposed schemes and highlight the significant covert performance gains achieved by employing multiple jamming antennas in IoT networks with limited cooperation.

IEEE Internet of Things Journal•Jan 30, 2026•1 citation

Use a Little Force to Move a Great Mass: A Jamming Leverage Strategy for Covert Communications

Tingting Wang, Zan Li, Jiangbo Si +3 more

We propose a joint covert beamforming design and jamming strategy to protect the communication process between Alice and Bob from being discovered by Willie with the help of another pair of neutral nodes. Specifically, with the help of irrelevant communication parties that commonly exist in practical communication scenarios, Jammer increases his transmission power by interfering with the neutral receiver, thus indirectly increasing the interference to Willie, which can be viewed as leveraging the force to make a big impact with a small effect. In our designed beamformer, we jointly optimize the beam power allocation factor, Alice’s transmission power, and Jammer’s transmission power when Alice transmits, to maximize the covert rate, which also maximizes Alice’s transmission power. In the perfect channel state information (CSI) scenario, the transformed optimization problem is solved via a one-dimensional search method and CVX solver. Due to the solution’s high complexity, we further propose a method to determine the optimal power allocation factor. For the imperfect Willie’s CSI scenario, three cases are investigated: Alice to Willie imperfect CSI, Transmitter to Willie imperfect CSI, and Jammer to Willie imperfect CSI. We utilize the S-procedure to tackle the optimization problem. Simulation results demonstrate the effectiveness of our proposed strategy.

IEEE Transactions on Information Forensics and Security•Jan 1, 2025•0 citations

Enhancing Covert Secrecy Rate in a Zero-Forcing UAV Jammer-Assisted Covert Communication

Xinying Chen, Zheng Chang, Timo Hämäläinen

Covert communications can hide confidential signals in environmental noise to avoid being detected and provide comprehensive security for wireless transmissions. However, there still exist significant risks in wireless transmission once being detected. In this letter, we propose a more secure covert scheme, where a multiple antennas transmitter, assisted by a multi-antenna UAV jammer, maximizes the covert secrecy rate under the scenarios of both correct and incorrect detection by a warden with both error detection probability and eavesdropping rate limitations satisfied. The transmitter and jammer adopt maximum ratio transmission (MRT) and zero-forcing, respectively, to maximize the transmission rate and minimize the interference at the legitimate receiver. First, we analyze the monotonicity of error detection probability to determine the optimal power detection threshold and the corresponding smallest error detection probability. Then, under this worst case, we jointly optimize the transmit and jamming power to maximize the covert secrecy rate while guaranteeing the covert and eavesdropping limits meet their requirements, respectively. Finally, simulation results are presented to prove the correctness of the theoretical conclusion and evaluate the effectiveness of our proposed scheme.

IEEE Wireless Communications Letters•Sep 23, 2024•17 citations
In multiple-input multiple-output covert communications, the joint beamforming of the legitimate transmitter (Alice) and a friendly jammer can enhance the covertness performance. However, such gains rely on instantaneous cooperation between Alice and the jammer, which could be intercepted by the warder, potentially compromising covertness. To address this issue, we consider a cognitive jammer-assisted covert communication architecture in which the jammer adapts its artificial noise transmission based on sensing Alice’s activity, without requiring real-time coordination. However, due to sensing errors, the cognitive operation produces mixed complex Gaussian observations at the warder, making the analytical characterization of covertness intractable. Consequently, the variational upper bound of the Kullback–Leibler divergence is introduced and derived as a tractable metric of covertness. Moreover, the absence of instantaneous cooperation renders centralized joint beamforming impractical. To meet this challenge, a separate optimization framework is introduced to decouple the beamforming design, and two individual algorithms based on successive convex approximation (SCA) and stochastic SCA are proposed for Alice and the jammer, respectively. Simulation results reveal that there exists an optimal antenna allocation strategy at the cognitive jammer that maximizes the covert rate, and demonstrate that the proposed cognitive jamming strategy achieves superior performance over benchmark schemes employing other jamming mechanisms, particularly in the high-power regime.
Covert transmission is investigated for a cooperative deception strategy, where a cooperative jammer (Jammer) tries to attract a multi-antenna adversary (Willie) and degrade the adversary’s reception ability for the signal from a transmitter (Alice). For this strategy, we formulate an optimization problem to maximize the covert rate when three different types of channel state information (CSI) are available. The total power is optimally allocated between Alice and Jammer subject to the Kullback-Leibler (KL) divergence constraint, which can be expressed analytically and be widely used as a covertness measurement. Different from the existing literature, in our proposed strategy, we also determine the optimal transmission power at the jammer when Alice is silent, while existing works always assume that the jammer’s power is fixed. Specifically, we apply the S-procedure to convert infinite constraints into linear-matrix-inequalities (LMI) constraints. When statistical CSI at Willie is available, we convert double integration to single integration using asymptotic approximation and substitution method. Finally, our simulation results show that for the proposed strategy, the covert rate is increased with the number of antennas at Willie. Moreover, compared to the benchmark, our proposed strategy is more robust in the presence of imperfect CSI.
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.
Covert communication conceals transmission of messages between Alice and Bob from an adversary, Willie, who tries to determine if a transmission took place or not. While covert communication in a basic, standard setting where all variables are known to Willie, results in the well-known square-root law, when a jammer is present and assists Alice by creating uncertainty in Willie's decoder, a strictly positive transmission rate is possible. In this work, we analyze the case where the jammer is equipped with multiple antennas. Specifically, we analyze the effect of multiple antennas at the jammer on Alice's transmission power and consequently on the transmission rate. We consider both the case where the channel knowledge of Willie is known as well as the case where it is unknown. We formulate several optimization problems for the transmission strategies of the jammer to maximize his assistance to Alice, in terms of maximizing Bob's received SNR and consequently the covert rate. When the channel information is known to the jammer, we show that under an achievable covertness scheme, the optimal strategy of the jammer is to perform beamforming towards a single direction with all his available power. This direction though, is not trivial, since it reflects a tradeoff point between minimizing the interference at Bob and maximizing the interference at Willie. When the channel knowledge is unknown, we show that the optimal strategy of the jammer is either to transmit isotropically to all directions or to the null-space of Bob, where this choice depends on certain channel conditions. This is in contrast to current schemes in the literature. Furthermore, we extend the optimization problems to the case where Bob is also equipped with multiple antennas, and provide insightful results, shown to be asymptotically optimal, accompanied by simulations.
Jamming antenna selection (JAS) serves as a low-complexity approach to enhance covert communication in Internet of Things (IoT) networks subject to stringent energy and computational limitations. Unlike conventional JAS strategies that assume a fully cooperative jammer selecting a single antenna for artificial noise transmission, this work investigates the optimal number of selected jamming antennas to maximize covert performance with a limited-cooperation jammer. In the considered scenario, the jammer does not provide the necessary cooperation, which prevents the legitimate receiver from acquiring the jammer–receiver channel state information (CSI). According to the degree of CSI availability at the jammer, two practical JAS schemes, random JAS (RJAS) and minimum JAS (MJAS), are investigated to effectively impair the warden’s detection performance. Closed-form expressions are derived for the warden’s expected minimum detection error probability and the legitimate receiver’s transmission outage probability, with the latter evaluated under interference-limited conditions. Leveraging these results, an optimization framework is developed to jointly determine the transmit power, transmission rate, and number of selected jamming antennas to maximize the effective covert rate. Numerical results illustrate that the effective covert rate under the RJAS strategy increases monotonically with the number of selected antennas, whereas the effective covert rate under the MJAS strategy is maximized when selecting two antennas. Both theoretical analysis and simulation results validate the effectiveness of the proposed schemes and highlight the significant covert performance gains achieved by employing multiple jamming antennas in IoT networks with limited cooperation.
We propose a joint covert beamforming design and jamming strategy to protect the communication process between Alice and Bob from being discovered by Willie with the help of another pair of neutral nodes. Specifically, with the help of irrelevant communication parties that commonly exist in practical communication scenarios, Jammer increases his transmission power by interfering with the neutral receiver, thus indirectly increasing the interference to Willie, which can be viewed as leveraging the force to make a big impact with a small effect. In our designed beamformer, we jointly optimize the beam power allocation factor, Alice’s transmission power, and Jammer’s transmission power when Alice transmits, to maximize the covert rate, which also maximizes Alice’s transmission power. In the perfect channel state information (CSI) scenario, the transformed optimization problem is solved via a one-dimensional search method and CVX solver. Due to the solution’s high complexity, we further propose a method to determine the optimal power allocation factor. For the imperfect Willie’s CSI scenario, three cases are investigated: Alice to Willie imperfect CSI, Transmitter to Willie imperfect CSI, and Jammer to Willie imperfect CSI. We utilize the S-procedure to tackle the optimization problem. Simulation results demonstrate the effectiveness of our proposed strategy.
Covert communications can hide confidential signals in environmental noise to avoid being detected and provide comprehensive security for wireless transmissions. However, there still exist significant risks in wireless transmission once being detected. In this letter, we propose a more secure covert scheme, where a multiple antennas transmitter, assisted by a multi-antenna UAV jammer, maximizes the covert secrecy rate under the scenarios of both correct and incorrect detection by a warden with both error detection probability and eavesdropping rate limitations satisfied. The transmitter and jammer adopt maximum ratio transmission (MRT) and zero-forcing, respectively, to maximize the transmission rate and minimize the interference at the legitimate receiver. First, we analyze the monotonicity of error detection probability to determine the optimal power detection threshold and the corresponding smallest error detection probability. Then, under this worst case, we jointly optimize the transmit and jamming power to maximize the covert secrecy rate while guaranteeing the covert and eavesdropping limits meet their requirements, respectively. Finally, simulation results are presented to prove the correctness of the theoretical conclusion and evaluate the effectiveness of our proposed scheme.