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

arXiv:2603.25549

Multi-User Covert Communication in Spatially Heterogeneous Wireless Networks

Jinyoung Lee, Hyeonsik Yeom

Published Mar 26, 2026• 0 citations
arXivHTMLPDF

Abstract

This paper investigates an uplink multi-user covert communication system with spatially distributed users. Unlike prior works that approximate channel statistics using averaged parameters and homogeneous assumptions, this study explicitly models each user's geometric position and corresponding user-to-Willie and user-to-Bob channel variances. This approach enables an accurate characterization of spatially heterogeneous covert environments. We mathematically prove that a generalized on-off power control scheme, which jointly accounts for both Bob's and Willie's channels, constitutes the optimal transmission strategy in heterogeneous user configurations. Leveraging the optimal strategy, we derive closed-form expressions for the minimum detection error probability and the minimum number of cooperative users required to satisfy a covert constraint. With the closed-form expressions, comprehensive theoretical analyses are conducted, which are validated by Monte-Carlo simulations. One important insight obtained from the analysis is that user spatial heterogeneity can enhance covert communication performance. Building on these findings, a piecewise search algorithm is proposed to achieve exact optimality with significantly reduced computational complexity. We demonstrate that optimization considering user's spatial heterogeneity achieves substantially improved covert communication performance than that based on the assumption of spatial homogeneity.

DOI
10.48550/arxiv.2603.25549

Related papers

Polarforming for MIMO Covert Communications

Xin Xie, Jinpeng Xu, Yihang Huang +2 more

Covert communication conceals wireless transmission activity, but conventional multi-antenna designs rely mainly on spatial beamforming and can be constrained by limited spatial degrees of freedom. This paper investigates polarization-reconfigurable antenna (PRA)-aided multiple-input multiple-output (MIMO) covert communication, where Alice and Bob perform transmit and receive polarforming, respectively, and Willie uses a vertically polarized antenna for radiometric detection. We jointly optimize the transmit covariance matrix and the transmit and receive phase shift vectors to maximize Bob's achievable rate under the covertness and transmit power constraints. Under Gaussian signaling, perfect polarized channel state information, and known noise power at Willie, we derive his optimal radiometric threshold and exact minimum detection error probability (DEP) for a finite observation length, and convert the DEP requirement into a deterministic constraint on his received signal power. We further prove that, for a fixed transmission design, positive signal leakage becomes detectable as the observation length tends to infinity. To solve the design problem for a finite observation length, we develop an alternating optimization (AO) algorithm with a generalized water-filling covariance update and closed-form phase updates. Numerical results validate the exact DEP analysis and the rapid convergence of the proposed algorithm. Compared with the sufficient divergence-based condition, the exact covertness constraint permits a $0.99$--$1.12$~dB higher received signal-to-noise ratio (SNR) at Willie, while joint transmit and receive polarforming provides a rate gain of up to $53.8\%$ over the considered benchmark schemes.

arXiv:2610.10466•Oct 7, 2026•0 citations

Target Sensing-Aided Covert Communication: Reduce Position Randomness

Xinwei Zhu, Weiwei Yang, Qiao Su +2 more

This paper investigates the covert communication in the scenario of counter detection. In traditional covert communication design where the uncertainty of the position of the Warden Willie typically reduces covert performance. To overcome this limitation, we leverage the sensing ability of the ISAC system in a new way to reduce the channel uncertainty between Alice and Willie, thereby enabling less conservative power allocation and significantly improving the achievable covert throughput. In the first stage, the dual functional sensing and communication (DFRC) base station Bob sends joint signals to estimate the azimuth of Willie and transmits information to Alice at the same time. In the second stage, Alice uses the obtained azimuth information of Willie to adjust transmit power while meeting the covert constraints. We build a mathematical model of azimuth angle estimation error and connect it with the Cramér-Rao Bound (CRB) to change it into distance error. This connects sensing accuracy with channel state information (CSI) uncertainty in a linear way, allowing Alice to adopt a higher transmit power while still satisfying the covert constraint, and thus improving the achievable covert throughput. To increase the covert throughput of the user, we use a layered solving strategy to decouple the original problem. First, we use S-procedure to change the constraint on possible distance error into a linear matrix inequality (LMI) constraint and then find the upper limit of transmit power on the user side. Second, we combine it with the uplink communication link rate constraint to find the closed form expression of the resource allocation strategy in vector space. Finally, we use one dimensional search to find the optimal time slot allocation strategy. Simulation results show that the proposed two-stage protocol effectively improves the achievable covert throughput by reducing position uncertainty through sensing.

IEEE Sensors Journal•Jun 11, 2026•1 citation

Statistical Indistinguishability in Multi-User Covert Communications Without Secret Information

Jinyoung Lee, Junguk Park, Sangseok Yun

This paper proposes a novel covert communication paradigm in which covertness emerges from network-induced structural uncertainty, eliminating the traditional reliance on pre-shared secret pilots in multi-user cooperative networks. Unlike conventional schemes that create information asymmetry through secret training sequences, we show that structural uncertainty naturally arises from user selection in spatially dispersed networks. Specifically, we consider a public pilot aided system under a worst-case adversarial assumption where Willie possesses full knowledge of all individual channel state information (CSI) but remains uncertain about the active subset of cooperative users. We prove that this selection-induced structural uncertainty renders different transmission states statistically indistinguishable from Willie’s perspective, thereby forcing the optimal detector to reduce to an energy-based test. The proposed framework demonstrates that robust covertness can be achieved without secrecy-based coordination, providing a scalable and practically viable alternative to secret pilot management in future wireless networks.

Mathematics•Apr 7, 2026•1 citation

Joint Covert and Secure Communication for SWIPT-Assisted CNOMA Systems

Gaojian Huang, Yuxin Lei, Xingwang Li +3 more

With the rapid advancement of physical-layer security technology, the covert and secure communication has become crucial in safeguarding wireless communication systems. In this article, we propose a joint covert and secure transmission scheme for simultaneous wireless information and power transfer (SWIPT) assisted cooperative nonorthogonal multiple access (CNOMA) systems. In the CNOMA system, a greedy relay transmits the confidential information to the far user (Carol), with the assistance of the near user (Bob). Meanwhile, as a SWIPT node, Bob is self-sustained by harvesting energy from relay. What is more, a warden (Alice) and noncolluding eavesdroppers (Eves) always attempt to detect and capture the confidential information, respectively. To counteract the attacks from Alice and Eves, a jamming-assisted scheme is employed. For the proposed system model, we derive closed-form expressions for the detection error probability (DEP) and the average minimum detection error probability (AMDEP) of Alice. Additionally, closed-form expressions for the outage probability (OP) of users and the intercept probability (IP) of Eves are obtained. Furthermore, to maximize the effective covert rate (ECR) of Carol, an optimization problem is formulated, subject to covertness and security constraints. Numerical results are provided to demonstrate the impact of the system parameters on covert and secure performance, with the results showing perfect agreement with the theoretical analysis.

IEEE Internet of Things Journal•Feb 19, 2025•17 citations

On the Covertness of Multi-User Wireless Networks Under Injection Attacks

Aadil Hussain Lone, Ali A. Nasir, Daniel Benevides da Costa

This letter addresses covert communication in multi-user wireless networks under cognitive adversarial reactive injection attacks. To protect the user links, a secret-key strategy is employed in which each user embeds its ON–OFF keying (OOK) symbols in an orthogonal mask and a frame-wise energy schedule drawn from a public dictionary. After key-aided demasking and energy normalization, the receiver Bob’s decision reduces to a variance test. We derive closed-form likelihood-ratio thresholds and error probabilities for Rayleigh slow and fast fading channel conditions, modeling the adversary Eve’s full-duplex injection as interference that changes the variance between ON state and OFF state transmissions. Asymptotically, error probabilities decay polynomially in the number of channel uses N under slow fading but exponentially under fast fading. Simulations validate these closed-form expressions, revealing clear gains in slow fading and fast fading conditions as N increases. The results show that key-assisted energy randomization and channel time variation jointly strengthen covertness against active injection attacks.

IEEE Wireless Communications Letters•Jan 1, 2026•1 citation

Covert Communication for UAV-Assisted Systems with an Active Warden

Mingjie Yang, Linying Tian, Chan Gao +1 more

To address the inherent openness of wireless communication environments, covert communication has emerged as a promising approach to protect legitimate transmissions from unauthorized detection. This paper investigates a UAVassisted wireless covert communication system, where channel uncertainty is exploited to enable covert information transmission in the presence of active wardens acting simultaneously as jamming sources. We first model the indirect communication strategy between legitimate parties and characterize the detection behavior of an active warden. To achieve both covertness and communication efficiency, the transmit power of the devices and the hovering positions of UAVs are jointly optimized, subject to the dual constraints of maintaining a sufficient covert communication rate and ensuring a high detection error probability at the warden. Closed-form expressions for the wardens detection error probability and the achievable covert communication rate are derived. Furthermore, numerical optimization is employed to maximize the achievable rate under covertness constraints. Simulation results corroborate the theoretical analysis and demonstrate the effectiveness of the proposed scheme in enabling covert communication in jamming-assisted active warden scenarios.

International Conference on Satellite Internet (SAT-NET)•Oct 27, 2025•0 citations
This paper investigates an uplink multi-user covert communication system with spatially distributed users. Unlike prior works that approximate channel statistics using averaged parameters and homogeneous assumptions, this study explicitly models each user's geometric position and corresponding user-to-Willie and user-to-Bob channel variances. This approach enables an accurate characterization of spatially heterogeneous covert environments. We mathematically prove that a generalized on-off power control scheme, which jointly accounts for both Bob's and Willie's channels, constitutes the optimal transmission strategy in heterogeneous user configurations. Leveraging the optimal strategy, we derive closed-form expressions for the minimum detection error probability and the minimum number of cooperative users required to satisfy a covert constraint. With the closed-form expressions, comprehensive theoretical analyses are conducted, which are validated by Monte-Carlo simulations. One important insight obtained from the analysis is that user spatial heterogeneity can enhance covert communication performance. Building on these findings, a piecewise search algorithm is proposed to achieve exact optimality with significantly reduced computational complexity. We demonstrate that optimization considering user's spatial heterogeneity achieves substantially improved covert communication performance than that based on the assumption of spatial homogeneity.
Covert communication conceals wireless transmission activity, but conventional multi-antenna designs rely mainly on spatial beamforming and can be constrained by limited spatial degrees of freedom. This paper investigates polarization-reconfigurable antenna (PRA)-aided multiple-input multiple-output (MIMO) covert communication, where Alice and Bob perform transmit and receive polarforming, respectively, and Willie uses a vertically polarized antenna for radiometric detection. We jointly optimize the transmit covariance matrix and the transmit and receive phase shift vectors to maximize Bob's achievable rate under the covertness and transmit power constraints. Under Gaussian signaling, perfect polarized channel state information, and known noise power at Willie, we derive his optimal radiometric threshold and exact minimum detection error probability (DEP) for a finite observation length, and convert the DEP requirement into a deterministic constraint on his received signal power. We further prove that, for a fixed transmission design, positive signal leakage becomes detectable as the observation length tends to infinity. To solve the design problem for a finite observation length, we develop an alternating optimization (AO) algorithm with a generalized water-filling covariance update and closed-form phase updates. Numerical results validate the exact DEP analysis and the rapid convergence of the proposed algorithm. Compared with the sufficient divergence-based condition, the exact covertness constraint permits a 0.990.990.99--1.121.121.12~dB higher received signal-to-noise ratio (SNR) at Willie, while joint transmit and receive polarforming provides a rate gain of up to 53.8%53.8\%53.8% over the considered benchmark schemes.
This paper investigates the covert communication in the scenario of counter detection. In traditional covert communication design where the uncertainty of the position of the Warden Willie typically reduces covert performance. To overcome this limitation, we leverage the sensing ability of the ISAC system in a new way to reduce the channel uncertainty between Alice and Willie, thereby enabling less conservative power allocation and significantly improving the achievable covert throughput. In the first stage, the dual functional sensing and communication (DFRC) base station Bob sends joint signals to estimate the azimuth of Willie and transmits information to Alice at the same time. In the second stage, Alice uses the obtained azimuth information of Willie to adjust transmit power while meeting the covert constraints. We build a mathematical model of azimuth angle estimation error and connect it with the Cramér-Rao Bound (CRB) to change it into distance error. This connects sensing accuracy with channel state information (CSI) uncertainty in a linear way, allowing Alice to adopt a higher transmit power while still satisfying the covert constraint, and thus improving the achievable covert throughput. To increase the covert throughput of the user, we use a layered solving strategy to decouple the original problem. First, we use S-procedure to change the constraint on possible distance error into a linear matrix inequality (LMI) constraint and then find the upper limit of transmit power on the user side. Second, we combine it with the uplink communication link rate constraint to find the closed form expression of the resource allocation strategy in vector space. Finally, we use one dimensional search to find the optimal time slot allocation strategy. Simulation results show that the proposed two-stage protocol effectively improves the achievable covert throughput by reducing position uncertainty through sensing.
This paper proposes a novel covert communication paradigm in which covertness emerges from network-induced structural uncertainty, eliminating the traditional reliance on pre-shared secret pilots in multi-user cooperative networks. Unlike conventional schemes that create information asymmetry through secret training sequences, we show that structural uncertainty naturally arises from user selection in spatially dispersed networks. Specifically, we consider a public pilot aided system under a worst-case adversarial assumption where Willie possesses full knowledge of all individual channel state information (CSI) but remains uncertain about the active subset of cooperative users. We prove that this selection-induced structural uncertainty renders different transmission states statistically indistinguishable from Willie’s perspective, thereby forcing the optimal detector to reduce to an energy-based test. The proposed framework demonstrates that robust covertness can be achieved without secrecy-based coordination, providing a scalable and practically viable alternative to secret pilot management in future wireless networks.
With the rapid advancement of physical-layer security technology, the covert and secure communication has become crucial in safeguarding wireless communication systems. In this article, we propose a joint covert and secure transmission scheme for simultaneous wireless information and power transfer (SWIPT) assisted cooperative nonorthogonal multiple access (CNOMA) systems. In the CNOMA system, a greedy relay transmits the confidential information to the far user (Carol), with the assistance of the near user (Bob). Meanwhile, as a SWIPT node, Bob is self-sustained by harvesting energy from relay. What is more, a warden (Alice) and noncolluding eavesdroppers (Eves) always attempt to detect and capture the confidential information, respectively. To counteract the attacks from Alice and Eves, a jamming-assisted scheme is employed. For the proposed system model, we derive closed-form expressions for the detection error probability (DEP) and the average minimum detection error probability (AMDEP) of Alice. Additionally, closed-form expressions for the outage probability (OP) of users and the intercept probability (IP) of Eves are obtained. Furthermore, to maximize the effective covert rate (ECR) of Carol, an optimization problem is formulated, subject to covertness and security constraints. Numerical results are provided to demonstrate the impact of the system parameters on covert and secure performance, with the results showing perfect agreement with the theoretical analysis.
This letter addresses covert communication in multi-user wireless networks under cognitive adversarial reactive injection attacks. To protect the user links, a secret-key strategy is employed in which each user embeds its ON–OFF keying (OOK) symbols in an orthogonal mask and a frame-wise energy schedule drawn from a public dictionary. After key-aided demasking and energy normalization, the receiver Bob’s decision reduces to a variance test. We derive closed-form likelihood-ratio thresholds and error probabilities for Rayleigh slow and fast fading channel conditions, modeling the adversary Eve’s full-duplex injection as interference that changes the variance between ON state and OFF state transmissions. Asymptotically, error probabilities decay polynomially in the number of channel uses N under slow fading but exponentially under fast fading. Simulations validate these closed-form expressions, revealing clear gains in slow fading and fast fading conditions as N increases. The results show that key-assisted energy randomization and channel time variation jointly strengthen covertness against active injection attacks.
To address the inherent openness of wireless communication environments, covert communication has emerged as a promising approach to protect legitimate transmissions from unauthorized detection. This paper investigates a UAVassisted wireless covert communication system, where channel uncertainty is exploited to enable covert information transmission in the presence of active wardens acting simultaneously as jamming sources. We first model the indirect communication strategy between legitimate parties and characterize the detection behavior of an active warden. To achieve both covertness and communication efficiency, the transmit power of the devices and the hovering positions of UAVs are jointly optimized, subject to the dual constraints of maintaining a sufficient covert communication rate and ensuring a high detection error probability at the warden. Closed-form expressions for the wardens detection error probability and the achievable covert communication rate are derived. Furthermore, numerical optimization is employed to maximize the achievable rate under covertness constraints. Simulation results corroborate the theoretical analysis and demonstrate the effectiveness of the proposed scheme in enabling covert communication in jamming-assisted active warden scenarios.