pith. sign in

arxiv: 2604.22790 · v1 · submitted 2026-04-13 · 📡 eess.SP · cs.CR· cs.GT

Structural Limits of Soft Fusion in Multi-Warden Covert Communication

Abbas Arghavani , Subhrakanti Dey , Anders Ahlen This is my paper

Pith reviewed 2026-05-10 16:08 UTC · model grok-4.3

classification 📡 eess.SP cs.CRcs.GT
keywords covert communicationsoft fusionfusion centermulti-wardenpower randomizationrobustness theoremgame theoryNash equilibrium
0
0 comments X

The pith

The optimal soft-fusion threshold for covert communication detection does not depend on the number of active wardens.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper studies covert wireless communication where a fusion center combines raw energy measurements from multiple wardens using soft fusion. It derives that the fusion center's optimal detection threshold is independent of how many wardens are active, so randomizing the number of wardens gives the fusion center no extra detection power. A robustness theorem shows that the sender Alice and a friendly jammer can still achieve reliable communication to Bob while keeping the probability of detection low, provided they can randomize their transmit powers over sufficiently large ranges. These results identify a structural limitation in soft fusion for multi-warden covert settings, even when the fusion center randomizes both warden count and threshold.

Core claim

The paper derives a closed-form expression for the fusion center's optimal soft-fusion threshold that is independent of the number of active wardens W. It further establishes a robustness theorem showing that Alice and the Jammer can maintain outage-feasible communication at Bob while preserving covertness with high probability under arbitrary fusion center randomization over (W, t), provided their power ranges are sufficiently large. A game-theoretic formulation then characterizes the Nash equilibrium mixed strategies of both sides, incorporating deployment costs and detection-pressure parameters.

What carries the argument

The closed-form optimal soft-fusion threshold, proven independent of W, and the accompanying robustness theorem under arbitrary FC randomization over (W, t).

If this is right

  • Soft fusion provides no meaningful detection advantage from strategic uncertainty about the number of wardens.
  • Alice and the Jammer can achieve outage-feasible communication while preserving covertness with high probability against arbitrary FC randomization.
  • The covertness-reliability tradeoff remains nearly invariant across wide ranges of FC deployment costs and strategy parameters.
  • Semi-strategic finite-support geometric randomization of W performs comparably to the full game-theoretic Nash equilibrium.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Detection systems relying on soft fusion may need to shift to hard decisions or other aggregation methods to gain meaningful benefit from additional wardens.
  • Increasing the number of wardens could prove inefficient under soft fusion, as marginal detection gains come at rising operational costs.
  • The observed invariance implies that covert communication links possess built-in robustness against this class of adaptive multi-sensor detection.

Load-bearing premise

Alice and the Jammer have power ranges large enough to adjust their transmissions to meet the outage constraint at Bob while keeping covertness with high probability under any FC randomization.

What would settle it

A numerical computation or simulation showing that the closed-form optimal soft-fusion threshold changes when the number of active wardens W varies would disprove the independence result.

Figures

Figures reproduced from arXiv: 2604.22790 by Abbas Arghavani, Anders Ahlen, Subhrakanti Dey.

Figure 1
Figure 1. Figure 1: System model: Alice transmits covertly to Bob with the [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: PFA +PMD versus threshold t for P(A) = P(J) = 2 mW and σ 2 w = 1 mW. The minimum occurs at t ⋆ ≈ 3.8312, matching Theorem 1. 0 0.2 0.4 0.6 0.8 1 1 - P out 0 0.2 0.4 0.6 0.8 1 PFA + PMD W = 1 W = 4 W = 16 W = 64 Large Small [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Soft-fusion tradeoff curves for fixed W. The near-total overlap across W ∈ {1, 4, 16, 64} is consistent with Corollary 1.1 and indicates that the covertness vs. 1 − Pout frontier is only weakly affected by sensing infrastructure scaling under soft fusion. (in terms of minimizing PFA + PMD) under the soft-fusion detection model. C. Soft Fusion Under Fixed W We first study the fundamental covertness vs. 1 − … view at source ↗
Figure 4
Figure 4. Figure 4: Optimal FC mixed strategy π F C,⋆(W). As the detection weight β increases, the Nash equilibrium shifts probability mass toward larger W. This behavior reflects FC’s willingness to incur higher deployment costs in exchange for marginal reductions in detection error that become utility-relevant under large β, despite the absence of a structural sensing gain under soft fusion. consistent with the W-independen… view at source ↗
Figure 5
Figure 5. Figure 5: Expected number of active Wardens E[W] versus the deployment cost parameter α. As sensing costs decrease, the equilib￾rium shifts probability mass toward larger deployments, despite the absence of a structural sensing gain under soft fusion. 10-1 100 101 102 1 1.2 1.4 1.6 1.8 2 2.2 2.4 2.6 E[W] [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 8
Figure 8. Figure 8: Covertness vs. 1 − Pout tradeoff under the finite-support geometric deployment baseline. Curves for different p nearly overlap, indicating minimal impact on detection performance. Warden deployment, the resulting performance gains remain negligible. This further confirms that soft fusion is largely insensitive to deployment scaling over the operating range considered here, with increased sensing resources … view at source ↗
Figure 9
Figure 9. Figure 9: Total detection error PF A + PMD as a function of p for several β under the finite-support geometric deployment baseline. The flat trend reinforces the insensitivity of soft fusion to W. 0 0.2 0.4 0.6 0.8 1 PFA 0 0.2 0.4 0.6 0.8 1 PMD = 0.1 = 1 = 4 = 16 = 64 [PITH_FULL_IMAGE:figures/full_fig_p010_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Operating points for p = 0.1 and various β. Increasing β improves the operating point but with diminishing returns. that randomized deployment does not materially change the observed tradeoff over the simulated range. Moreover, it suggests that even in the absence of strategic optimization, increasing the sensing infrastructure does not mitigate the impact of Alice’s power randomization, highlighting that… view at source ↗
read the original abstract

This paper investigates covert wireless communication with a Fusion Center (FC) that aggregates raw energy measurements from multiple Wardens via soft fusion. Extending our prior work on power-threshold randomization, we consider a stronger adversarial model in which FC randomizes both the number of active Wardens W and the detection threshold t, while Alice and a friendly Jammer jointly randomize their transmit powers under an outage constraint at Bob. We derive a closed-form expression for FC's optimal soft-fusion threshold and show that it is independent of the number of active Wardens. Thus, strategic uncertainty in the sensing infrastructure provides no meaningful detection advantage for FC under soft fusion. We further establish a robustness theorem showing that, even under arbitrary FC randomization over (W,t), Alice and Jammer can maintain outage-feasible communication at Bob while preserving covertness with high probability, provided their power ranges are sufficiently large. This reveals a structural limitation of soft fusion. A game-theoretic formulation characterizes the Nash equilibrium mixed strategies of both sides, accounting for deployment costs and detection-pressure parameters. Analytical and numerical results show that: 1) soft fusion is largely insensitive to the number of Wardens; 2) even semi-strategic finite-support geometric randomization of W performs comparably to the full game-theoretic equilibrium; and 3) the covertness-reliability tradeoff remains nearly invariant across a wide range of FC deployment costs and strategy parameters. These findings exemplify a Red Queen effect, in which FC incurs increasing operational costs for only marginal gains in detection performance, and highlight the need for alternative detection architectures.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper examines covert wireless communication where a Fusion Center (FC) aggregates energy measurements from multiple Wardens using soft fusion. It derives a closed-form expression for the FC's optimal soft-fusion threshold, proving independence from the number of active Wardens W. A robustness theorem shows that Alice and a Jammer can sustain outage-feasible communication at Bob while preserving covertness with high probability against arbitrary FC randomization over (W, t), provided their power ranges are sufficiently large. The work formulates a game-theoretic Nash equilibrium incorporating deployment costs and detection-pressure parameters, with analytical and numerical results demonstrating soft fusion's insensitivity to W, comparable performance of semi-strategic randomization, and an invariant covertness-reliability tradeoff, exemplifying a Red Queen effect.

Significance. If the derivations and theorem hold, the results identify a structural limitation of soft fusion: strategic uncertainty in the warden infrastructure confers no detection advantage, and FC gains are marginal despite rising costs. The closed-form threshold expression and game-theoretic characterization of mixed strategies are notable strengths, as is the explicit demonstration that finite-support geometric randomization of W performs nearly as well as the full equilibrium. These findings could inform the design of detection architectures in adversarial wireless settings.

major comments (2)
  1. [Robustness theorem] Robustness theorem (as stated in the abstract and developed in the main text): the claim that Alice and Jammer can maintain outage-feasible communication while preserving covertness with high probability under arbitrary FC randomization over (W,t) is conditioned on 'sufficiently large' power ranges, but no explicit lower bound, scaling law, or dependence on the cardinality of the support of FC's mixed strategy is derived. This assumption is load-bearing for the headline conclusion that soft fusion has structural limits and that uncertainty in W provides no advantage; without quantification it is unclear whether the result holds for finite practical deployments or only in an asymptotic regime.
  2. [FC optimization section] Derivation of closed-form optimal soft-fusion threshold (abstract and § on FC optimization): the independence from W is presented as a key result, but the supporting steps rely on specific assumptions about noise distributions, energy measurement models, and outage constraints at Bob that are not cross-verified against the robustness theorem's randomization; a concrete check (e.g., substitution of the closed-form back into the detection probability expression) is needed to confirm the independence survives the joint power randomization.
minor comments (1)
  1. [Abstract] The abstract refers to 'analytical and numerical results' and 'Table' or 'Figure' comparisons but does not explicitly cross-reference the specific tables or figures that support claims 1-3 in the final paragraph; adding these citations would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough and constructive review. We address each major comment below and will revise the manuscript accordingly to strengthen the presentation and address the concerns raised.

read point-by-point responses

  1. Referee: [Robustness theorem] Robustness theorem (as stated in the abstract and developed in the main text): the claim that Alice and Jammer can maintain outage-feasible communication while preserving covertness with high probability under arbitrary FC randomization over (W,t) is conditioned on 'sufficiently large' power ranges, but no explicit lower bound, scaling law, or dependence on the cardinality of the support of FC's mixed strategy is derived. This assumption is load-bearing for the headline conclusion that soft fusion has structural limits and that uncertainty in W provides no advantage; without quantification it is unclear whether the result holds for finite practical deployments or only in an asymptotic regime.

    Authors: We appreciate this observation on the robustness theorem. The theorem establishes that for any fixed support of the FC's mixed strategy, sufficiently large power ranges exist such that covertness holds with high probability while satisfying the outage constraint at Bob; the proof relies on concentration inequalities that tighten with increasing range. We agree that an explicit quantification would improve clarity for practical settings. In the revised manuscript we will add a corollary providing a sufficient scaling condition on the required power range in terms of the support cardinality M (specifically, ranges that grow logarithmically with M suffice to drive the failure probability below any fixed epsilon), together with numerical examples for moderate M. This directly addresses applicability to finite deployments without changing the theorem statement. revision: yes

  2. Referee: [FC optimization section] Derivation of closed-form optimal soft-fusion threshold (abstract and § on FC optimization): the independence from W is presented as a key result, but the supporting steps rely on specific assumptions about noise distributions, energy measurement models, and outage constraints at Bob that are not cross-verified against the robustness theorem's randomization; a concrete check (e.g., substitution of the closed-form back into the detection probability expression) is needed to confirm the independence survives the joint power randomization.

    Authors: We thank the referee for this verification request. The closed-form threshold is obtained from the likelihood-ratio test on the soft-fusion statistic under the Gaussian noise and energy-detection model used throughout the paper, and the independence from W follows from cancellation in the aggregated distribution. To explicitly confirm consistency with the randomized-power setting of the robustness theorem, we will insert in the revised manuscript a direct substitution of the threshold into the expression for the FC detection probability, followed by averaging over the joint power randomization. The resulting expression remains independent of W, confirming that the structural property is preserved under the stronger adversarial model. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivations are self-contained analytical results

full rationale

The paper derives a closed-form expression for the FC's optimal soft-fusion threshold and proves a robustness theorem under an explicit assumption of sufficiently large power ranges, using standard game-theoretic equilibrium analysis for mixed strategies. These steps rely on the paper's own equations and modeling assumptions rather than reducing to prior fitted parameters or self-referential definitions. The reference to extending prior work on power-threshold randomization provides context but does not carry the load of the central claims, which are independently established here via direct derivation. No predictions are statistically forced by construction from inputs, and the results remain falsifiable through the stated analytical and numerical evaluations.

Axiom & Free-Parameter Ledger

2 free parameters · 2 axioms · 0 invented entities

Based on abstract only; the paper likely relies on standard communication theory axioms and introduces parameters for the game but no new invented entities. Free parameters include deployment costs and detection-pressure parameters used in the equilibrium analysis.

free parameters (2)
  • deployment costs
    Parameters in the game-theoretic formulation accounting for FC operational costs when choosing strategies over W and t.
  • detection-pressure parameters
    Parameters characterizing the mixed strategies in the Nash equilibrium between Alice/Jammer and FC.
axioms (2)
  • domain assumption Standard assumptions on wireless channel models such as additive white Gaussian noise and energy detection at wardens.
    Typical in covert communication papers and invoked for deriving the closed-form threshold and robustness results.
  • domain assumption Outage constraint at Bob is feasible under joint power randomization by Alice and Jammer.
    Central to the robustness theorem and the ability to preserve covertness with high probability.

pith-pipeline@v0.9.0 · 5588 in / 1644 out tokens · 89937 ms · 2026-05-10T16:08:52.220756+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages

  1. [1]

    The evolution of rationality and the red queen,

    A. J. Robson, “The evolution of rationality and the red queen,”Journal of Economic Theory, vol. 111, no. 1, pp. 1–22, 2003

    work page 2003

  2. [2]

    Limits of reliable communica- tion with low probability of detection on awgn channels,

    B. A. Bash, D. Goeckel, and D. Towsley, “Limits of reliable communica- tion with low probability of detection on awgn channels,”IEEE journal on selected areas in communications, vol. 31, no. 9, pp. 1921–1930, 2013

    work page 1921

  3. [3]

    Achieving undetectable communication,

    S. Lee, R. J. Baxley, M. A. Weitnauer, and B. Walkenhorst, “Achieving undetectable communication,”IEEE Journal of Selected Topics in Signal Processing, vol. 9, no. 7, pp. 1195–1205, 2015

    work page 2015

  4. [4]

    Covert communication with power uncertainty for d2d content sharing,

    C. Wan, D. Wu, M. Wang, X. Shi, and X. Guan, “Covert communication with power uncertainty for d2d content sharing,” in2019 11th Interna- tional Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2019, pp. 1–6

    work page 2019

  5. [5]

    On covert communication with interference uncertainty,

    Z. Liu, J. Liu, Y . Zeng, J. Ma, and Q. Huang, “On covert communication with interference uncertainty,” in2018 IEEE International Conference on Communications (ICC). IEEE, 2018, pp. 1–6

    work page 2018

  6. [6]

    On covert communication with noise uncertainty,

    B. He, S. Yan, X. Zhou, and V . K. Lau, “On covert communication with noise uncertainty,”IEEE Communications Letters, vol. 21, no. 4, pp. 941–944, 2017

    work page 2017

  7. [7]

    Covert communication in the presence of an uninformed jammer,

    T. V . Sobers, B. A. Bash, S. Guha, D. Towsley, and D. Goeckel, “Covert communication in the presence of an uninformed jammer,”IEEE Transactions on Wireless Communications, vol. 16, no. 9, pp. 6193– 6206, 2017

    work page 2017

  8. [8]

    Covert wireless communication with artificial noise generation,

    R. Soltani, D. Goeckel, D. Towsley, B. A. Bash, and S. Guha, “Covert wireless communication with artificial noise generation,”IEEE Trans- actions on Wireless Communications, vol. 17, no. 11, pp. 7252–7267, 2018

    work page 2018

  9. [9]

    Delay- intolerant covert communications with either fixed or random transmit power,

    S. Yan, B. He, X. Zhou, Y . Cong, and A. L. Swindlehurst, “Delay- intolerant covert communications with either fixed or random transmit power,”IEEE Transactions on Information Forensics and Security, vol. 14, no. 1, pp. 129–140, 2019

    work page 2019

  10. [10]

    Optimal power adaptation in covert communication with an uninformed jammer,

    K. Li, P. A. Kelly, and D. Goeckel, “Optimal power adaptation in covert communication with an uninformed jammer,”IEEE Transactions on Wireless Communications, vol. 19, no. 5, pp. 3463–3473, 2020

    work page 2020

  11. [11]

    Jamming aided covert communication with multiple receivers,

    K.-W. Huang, H. Deng, and H.-M. Wang, “Jamming aided covert communication with multiple receivers,”IEEE Transactions on Wireless Communications, vol. 20, no. 7, pp. 4480–4494, 2021

    work page 2021

  12. [12]

    Covert communication with cognitive jammer,

    W. Xiong, Y . Yao, X. Fu, and S. Li, “Covert communication with cognitive jammer,”IEEE Wireless Communications Letters, vol. 9, no. 10, pp. 1753–1757, 2020

    work page 2020

  13. [13]

    Multi-antenna covert communications in random wireless networks,

    T.-X. Zheng, H.-M. Wang, D. W. K. Ng, and J. Yuan, “Multi-antenna covert communications in random wireless networks,”IEEE Transac- tions on Wireless Communications, vol. 18, no. 3, pp. 1974–1987, 2019

    work page 1974

  14. [14]

    Performance analysis and optimization for jammer-aided multiantenna uav covert communication,

    H. Du, D. Niyato, Y .-A. Xie, Y . Cheng, J. Kang, and D. I. Kim, “Performance analysis and optimization for jammer-aided multiantenna uav covert communication,”IEEE Journal on Selected Areas in Com- munications, vol. 40, no. 10, pp. 2962–2979, 2022

    work page 2022

  15. [15]

    Covert communications with friendly jamming in internet of vehicles,

    H. Zhang, Y . Zou, D. Yu, J. Yu, and X. Cheng, “Covert communications with friendly jamming in internet of vehicles,”Vehicular Communica- tions, vol. 35, p. 100472, 2022

    work page 2022

  16. [16]

    Covert wireless communi- cation with a poisson field of interferers,

    B. He, S. Yan, X. Zhou, and H. Jafarkhani, “Covert wireless communi- cation with a poisson field of interferers,”IEEE Transactions on Wireless Communications, vol. 17, no. 9, pp. 6005–6017, 2018

    work page 2018

  17. [17]

    Multi-antenna jamming in covert communication,

    O. Shmuel, A. Cohen, and O. Gurewitz, “Multi-antenna jamming in covert communication,”IEEE Transactions on Communications, vol. 69, no. 7, pp. 4644–4658, 2021

    work page 2021

  18. [18]

    Uav-aided covert communication with a multi-antenna jammer,

    X. Chen, N. Zhang, J. Tang, M. Liu, N. Zhao, and D. Niyato, “Uav-aided covert communication with a multi-antenna jammer,”IEEE Transactions on Vehicular Technology, vol. 70, no. 11, pp. 11 619–11 631, 2021

    work page 2021

  19. [19]

    Covert communi- cation using null space and 3d beamforming: Uncertainty of willie’s location information,

    M. Forouzesh, P. Azmi, N. Mokari, and D. Goeckel, “Covert communi- cation using null space and 3d beamforming: Uncertainty of willie’s location information,”IEEE Transactions on Vehicular Technology, vol. 69, no. 8, pp. 8568–8576, 2020

    work page 2020

  20. [20]

    Covert wireless communication in presence of a multi-antenna adversary and delay constraints,

    K. Shahzad, X. Zhou, and S. Yan, “Covert wireless communication in presence of a multi-antenna adversary and delay constraints,”IEEE Transactions on Vehicular Technology, vol. 68, no. 12, pp. 12 432– 12 436, 2019

    work page 2019

  21. [21]

    Covert millimeter-wave communi- cation: Design strategies and performance analysis,

    M. V . Jamali and H. Mahdavifar, “Covert millimeter-wave communi- cation: Design strategies and performance analysis,”IEEE Transactions on Wireless Communications, vol. 21, no. 6, pp. 3691–3704, 2021

    work page 2021

  22. [22]

    Optimal data fusion in multiple sensor detection systems,

    Z. Chair and P. K. Varshney, “Optimal data fusion in multiple sensor detection systems,”IEEE Transactions on Aerospace and Electronic Systems, vol. 22, no. 1, pp. 98–101, Jan. 1986

    work page 1986

  23. [23]

    Linear soft combination for cooperative spectrum sensing in cognitive radio networks,

    H. Guo, W. Jiang, and W. Luo, “Linear soft combination for cooperative spectrum sensing in cognitive radio networks,”IEEE Communications Letters, vol. 21, no. 7, pp. 1573–1576, 2017

    work page 2017

  24. [24]

    A soft–hard combination decision fusion scheme for a clustered distributed detection system with multiple sensors,

    J. Luo and X. He, “A soft–hard combination decision fusion scheme for a clustered distributed detection system with multiple sensors,”Sensors, vol. 18, no. 12, p. 4370, 2018

    work page 2018

  25. [25]

    A game-theoretic approach to covert communications in the presence of multiple colluding wardens,

    A. Arghavani, A. Ahl ´en, A. Teixeira, and S. Dey, “A game-theoretic approach to covert communications in the presence of multiple colluding wardens,” inIEEE Wireless Communications and Networking Confer- ence (WCNC). IEEE, 2021, pp. 1–7

    work page 2021

  26. [26]

    Covert outage minimization in the presence of multiple wardens,

    A. Arghavani, S. Dey, and A. Ahl ´en, “Covert outage minimization in the presence of multiple wardens,”IEEE Transactions on Signal Processing, vol. 71, pp. 686–700, 2023

    work page 2023

  27. [27]

    A game-theoretic approach to covert communications,

    A. S. Leong, D. E. Quevedo, and S. Dey, “A game-theoretic approach to covert communications,” in2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Communications. IEEE, 2020, pp. 1–6

    work page 2020

  28. [28]

    R. J. Aumann and S. Hart,Handbook of game theory with economic applications. Elsevier, 1992, vol. 2

    work page 1992

  29. [29]

    Outage probability at arbitrary snr with cooperative diversity,

    Y . Zhao, R. Adve, and T. J. Lim, “Outage probability at arbitrary snr with cooperative diversity,”IEEE communications letters, vol. 9, no. 8, pp. 700–702, 2005

    work page 2005

  30. [30]

    Heartbeats based biometric random binary sequences generation to se- cure wireless body sensor networks,

    S. Pirbhulal, H. Zhang, W. Wu, S. C. Mukhopadhyay, and Y .-T. Zhang, “Heartbeats based biometric random binary sequences generation to se- cure wireless body sensor networks,”IEEE Transactions on Biomedical Engineering, vol. 65, no. 12, pp. 2751–2759, 2018

    work page 2018

  31. [31]

    On the energy detec- tion of unknown signals over fading channels,

    F. F. Digham, M.-S. Alouini, and M. K. Simon, “On the energy detec- tion of unknown signals over fading channels,” inIEEE International Conference on Communications, 2003. ICC’03., vol. 5. Ieee, 2003, pp. 3575–3579

    work page 2003

  32. [32]

    The distribution of the sum of independent gamma random variables,

    P. G. Moschopoulos, “The distribution of the sum of independent gamma random variables,”Annals of the Institute of Statistical Mathematics, vol. 37, no. 3, pp. 541–544, 1985

    work page 1985