pith. sign in

arxiv: 1906.12092 · v1 · pith:ACIPNA2Vnew · submitted 2019-06-28 · 💻 cs.IT · math.IT

Throughput Scaling of Covert Communication over Wireless Adhoc Networks

Kang-Hee Cho , Si-Hyeon Lee , Vincent Y. F. Tan This is my paper

Pith reviewed 2026-05-25 13:31 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords covert communicationwireless ad hoc networksthroughput scalingpreservation regionsmulti-hop routinghierarchical cooperationwarden nodes
0
0 comments X

The pith

Covert communication in ad hoc networks with n^kappa wardens achieves the same throughput scaling as non-covert networks via preservation regions and rerouted paths.

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

The paper examines throughput scaling in a wireless ad hoc network containing roughly n legitimate nodes and n to the power kappa warden nodes, where 0 less than kappa less than 1, all placed randomly in a unit square. Legitimate sources must communicate with destinations such that no warden can detect the transmissions, which forces limits on transmit power. The authors introduce preservation regions around each warden that block transmissions inside them, enabling higher powers outside while preserving covertness. They modify multi-hop, hierarchical cooperation, and hybrid schemes to route data around these regions with evenly distributed detours, and prove matching upper bounds on scaling when all active legitimate nodes use identical average transmit power.

Core claim

Under the covert communication constraint, the throughput scaling law is achieved by multi-hop, hierarchical cooperation, and hybrid schemes with suitably modified data paths around preservation regions, and matching upper bounds hold when every active legitimate node consumes the same average transmit power over the time period in which the wardens observe the channel outputs.

What carries the argument

Preservation regions around each warden node that forbid transmissions inside to allow higher transmit powers outside while maintaining covertness, combined with evenly distributed detours in data paths for multi-hop and hybrid schemes.

If this is right

  • Modified multi-hop routing with detours around preservation regions achieves the covert throughput scaling law.
  • Hierarchical cooperation with adjusted symbol power and scheduling achieves the covert throughput scaling law.
  • Hybrid hierarchical-multi-hop schemes with path modifications achieve the covert throughput scaling law.
  • Upper bounds on throughput match the lower bounds achieved by the schemes when all active nodes use equal average transmit power.

Where Pith is reading between the lines

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

  • The preservation-region technique could extend to scenarios with spatially varying warden densities without changing the overall scaling order.
  • At higher warden densities closer to linear in n, overlapping preservation regions might force additional power reductions that alter the scaling.
  • Allowing nodes to adapt preservation region sizes dynamically based on local activity could reduce average detour lengths and improve finite-n performance.

Load-bearing premise

Every active legitimate node consumes the same average transmit power over the period when wardens observe the channel outputs.

What would settle it

A calculation or simulation in which nodes use unequal average transmit powers and the achieved throughput scaling exceeds the upper bound stated for the equal-power case.

Figures

Figures reproduced from arXiv: 1906.12092 by Kang-Hee Cho, Si-Hyeon Lee, Vincent Y. F. Tan.

Figure 1
Figure 1. Figure 1: The network model considered in this paper. The circl [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Example of a MH scheme with detouring paths in the pres [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: An illustration of the four operating regimes depend 1 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Example of the original MH scheme. Each data path cons [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Examples of modified data paths that detour the preser [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Example of an expanded preservation region. The whit [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗
Figure 9
Figure 9. Figure 9: The white circles are LNs and the gray squares are WNs. [PITH_FULL_IMAGE:figures/full_fig_p007_9.png] view at source ↗
Figure 11
Figure 11. Figure 11: Example of the worst case that the interference to a W [PITH_FULL_IMAGE:figures/full_fig_p008_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Distribute the MIMO transmissions from each cluste [PITH_FULL_IMAGE:figures/full_fig_p011_12.png] view at source ↗
Figure 16
Figure 16. Figure 16: Example of the modified hybrid scheme. In the global M [PITH_FULL_IMAGE:figures/full_fig_p012_16.png] view at source ↗
Figure 15
Figure 15. Figure 15: Example of the hybrid HC-MH scheme. The HC scheme is [PITH_FULL_IMAGE:figures/full_fig_p012_15.png] view at source ↗
Figure 17
Figure 17. Figure 17: Example of the information flow in the network. The ar [PITH_FULL_IMAGE:figures/full_fig_p014_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: Examples of expanded preservation regions that blo [PITH_FULL_IMAGE:figures/full_fig_p016_18.png] view at source ↗
read the original abstract

We consider the problem of covert communication over wireless adhoc networks in which (roughly) $n$ legitimate nodes (LNs) and $n^{\kappa}$ for $0<\kappa<1$ non-communicating warden nodes (WNs) are randomly distributed in a square of unit area. Each legitimate source wants to communicate with its intended destination node while ensuring that every WN is unable to detect the presence of the communication. In this scenario, we study the throughput scaling law. Due the covert communication constraint, the transmit powers are necessarily limited. Under this condition, we introduce a preservation region around each WN. This region serves to prevent transmission from the LNs and to increase the transmit power of the LNs outside the preservation regions. For the achievability results, multi-hop (MH), hierarchical cooperation (HC), and hybrid HC-MH schemes are utilized with some appropriate modifications. In the proposed MH and hybrid schemes, because the preservation regions may impede communication along direct data paths, the data paths are suitably modified by taking a detour around each preservation region. To avoid the concentration of detours resulting extra relaying burdens, we distribute the detours evenly over a wide region. In the proposed HC scheme, we control the symbol power and the scheduling of distributed multiple-input multiple-output transmission. We also present matching upper bounds on the throughput scaling under the assumption that every active LN consumes the same average transmit power over the time period in which the WNs observe the channel outputs.

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 / 0 minor

Summary. The paper studies throughput scaling for covert communication in a wireless ad hoc network with n legitimate nodes (LNs) and n^κ (0<κ<1) warden nodes (WNs) randomly placed in a unit square. Each LN source-destination pair must communicate while keeping every WN unable to detect the transmission. The authors introduce preservation regions around each WN to limit LN transmit powers, then derive achievability results by modifying multi-hop (MH), hierarchical cooperation (HC), and hybrid HC-MH schemes (with data-path detours around preservation regions in the MH and hybrid cases, and power/scheduling control in HC). Matching upper bounds are stated under the explicit modeling assumption that every active LN consumes identical average transmit power during the WN observation window.

Significance. If the central scaling exponents are shown to hold without post-hoc parameter tuning, the work would supply the first scaling-law characterization of covertness constraints in large random networks, extending classical ad hoc network results (Gupta-Kumar, Özgür et al.) to the covert regime and quantifying the impact of warden density κ. The explicit construction of detour routing that distributes relaying load evenly is a concrete technical contribution.

major comments (2)
  1. [Abstract] Abstract (upper-bound paragraph): the matching upper bounds are derived only under the modeling assumption that 'every active LN consumes the same average transmit power over the time period in which the WNs observe the channel outputs.' This assumption is not shown to follow from the per-WN covertness constraint nor argued to be the worst case; heterogeneous per-LN powers (still satisfying the covertness condition at each WN) could alter the aggregate energy or the detection statistic and potentially improve the scaling exponent. Because the converse is load-bearing for the claimed 'matching' result, the gap must be closed.
  2. [Abstract / preservation-region definition] The radius of each preservation region is listed as a free parameter in the model. The achievability constructions and the upper-bound derivation both depend on a specific choice of this radius; the manuscript must state the exact functional dependence on n and κ and verify that the same radius works for both the lower and upper bounds without additional tuning.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive comments on our manuscript. The two major comments raise important points about the modeling assumptions in the upper bound and the specification of the preservation region radius. We address each below and indicate where revisions will be made to the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract (upper-bound paragraph): the matching upper bounds are derived only under the modeling assumption that 'every active LN consumes the same average transmit power over the time period in which the WNs observe the channel outputs.' This assumption is not shown to follow from the per-WN covertness constraint nor argued to be the worst case; heterogeneous per-LN powers (still satisfying the covertness condition at each WN) could alter the aggregate energy or the detection statistic and potentially improve the scaling exponent. Because the converse is load-bearing for the claimed 'matching' result, the gap must be closed.

    Authors: We acknowledge the referee's observation that the uniform-power assumption for the converse is stated explicitly but not derived from the per-WN covertness constraint. This modeling choice is adopted because the achievability constructions employ uniform power control outside the preservation regions, and the assumption allows a clean characterization of the aggregate energy observed by each warden. We agree that a more rigorous argument is required to establish that heterogeneous powers (still meeting the per-warden covertness condition) cannot improve the scaling exponent. In the revised manuscript we will add a dedicated paragraph in the converse section justifying the assumption or, if necessary, qualify the 'matching' claim accordingly. revision: yes

  2. Referee: [Abstract / preservation-region definition] The radius of each preservation region is listed as a free parameter in the model. The achievability constructions and the upper-bound derivation both depend on a specific choice of this radius; the manuscript must state the exact functional dependence on n and κ and verify that the same radius works for both the lower and upper bounds without additional tuning.

    Authors: The radius of each preservation region is chosen to balance the conflicting requirements of limiting transmissions near wardens while permitting sufficient power elsewhere; its scaling is a function of both n and κ. We will revise the model section and the abstract to state the precise order (specifically Θ(n^−β(κ)) for an explicit β depending on κ) and to confirm that this identical functional form is used without retuning in both the achievability constructions (including the detour routing) and the upper-bound analysis. revision: yes

Circularity Check

0 steps flagged

No significant circularity; upper bounds explicitly conditioned on uniform-power assumption with no reduction to inputs by construction.

full rationale

The paper states its matching upper bounds only under the explicit assumption that every active LN consumes the same average transmit power during the WN observation window. This is presented as a modeling choice for the converse result rather than derived from the covertness constraint. Achievability proceeds via modified MH/HC/hybrid schemes with preservation regions and detours, independent of that assumption. No equation or claim reduces a derived quantity to a fitted parameter, self-citation chain, or input by construction. The derivation remains self-contained against the stated assumption.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 1 invented entities

The central claim rests on the random geometric network model, the definition of covertness via warden detection, and the newly introduced preservation regions whose radius is chosen to enforce the power limit. No machine-checked proofs or shipped code are mentioned.

free parameters (1)
  • preservation region radius
    Chosen to prevent transmission near each WN and to allow higher power outside; size is a design parameter that directly affects feasible transmit power and detour lengths.
axioms (2)
  • domain assumption Legitimate nodes and wardens are randomly and uniformly distributed in a unit square.
    Standard modeling assumption for wireless ad hoc scaling laws invoked throughout the achievability and converse arguments.
  • domain assumption Covertness requires that every warden cannot detect the presence of communication.
    Core problem constraint that forces power limits and preservation regions.
invented entities (1)
  • preservation region no independent evidence
    purpose: Region around each warden where legitimate transmissions are forbidden to enforce covertness and allow higher power elsewhere.
    New construct introduced to handle the covert constraint; no independent evidence outside the model is provided.

pith-pipeline@v0.9.0 · 5803 in / 1537 out tokens · 26500 ms · 2026-05-25T13:31:32.878382+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

21 extracted references · 21 canonical work pages

  1. [1]

    Limits of reliabl e commu- nication with low probability of detection on AWGN channels ,

    B. A. Bash, D. Goeckel, and D. Towsley, “Limits of reliabl e commu- nication with low probability of detection on AWGN channels ,” IEEE Journal on Selected Areas in Communications , vol. 31, no. 9, pp. 1921– 1930, Sep. 2013

    work page 1921

  2. [2]

    Fundamental limits of communication with low probability of detection,

    L. Wang, G. W. Wornell, and L. Zheng, “Fundamental limits of communication with low probability of detection,” IEEE Transactions on Information Theory , vol. 62, no. 6, pp. 3493–3503, June 2016

    work page 2016

  3. [3]

    Covert communication over noisy channels: A resolv- ability perspective,

    M. R. Bloch, “Covert communication over noisy channels: A resolv- ability perspective,” IEEE Transactions on Information Theory , vol. 62, no. 5, pp. 2334–2354, May 2016

    work page 2016

  4. [4]

    Reliable deni able communication with channel uncertainty,

    P . H. Che, M. Bakshi, C. Chan, and S. Jaggi, “Reliable deni able communication with channel uncertainty,” in Proc. IEEE Information Theory W orkshop, Hobart, TAS, Australia, Nov 2014, pp. 30–34

    work page 2014

  5. [5]

    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, Oct 2015

    work page 2015

  6. [6]

    Fundamental limits of cov ert com- munication over MIMO AWGN channel,

    A. Abdelaziz and C. E. Koksal, “Fundamental limits of cov ert com- munication over MIMO AWGN channel,” in Proc. IEEE Conference on Communications and Network Security , Las V egas, NV , USA, Oct 2017, pp. 1–9

    work page 2017

  7. [7]

    Covert capacity of non- coherent Rayleigh-fading channels,

    M. Tahmasbi, A. Savard, and M. R. Bloch, “Covert capacity of non- coherent Rayleigh-fading channels,” 2018, arXiv:1810.07 687

    work page 2018

  8. [8]

    Covert c om- munication with channel-state information at the transmit ter,

    S.-H. Lee, L. Wang, A. Khisti, and G. W. Wornell, “Covert c om- munication with channel-state information at the transmit ter,” IEEE Transactions on Information F orensics and Security , vol. 13, no. 9, pp. 2310–2319, Sep. 2018

    work page 2018

  9. [9]

    Keyless covert communi cation over multiple-access channels,

    K. S. K. Arumugam and M. R. Bloch, “Keyless covert communi cation over multiple-access channels,” in Proc. IEEE International Symposium on Information Theory , Jul. 2016, pp. 2229–2233

    work page 2016

  10. [10]

    Time-division is optimal for covert communication over some broadcast channels,

    V . Y . F. Tan and S.-H. Lee, “Time-division is optimal for covert communication over some broadcast channels,” IEEE Transactions on Information F orensics and Security, vol. 14, no. 5, pp. 1377–1389, May 2019

    work page 2019

  11. [11]

    Covert wireless communication with artificial noise generation,

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

    work page 2018

  12. [12]

    The square root law of steganographic capacity,

    A. D. Ker, T. Pevn´ y, J. Kodovsk´ y, and J. Fridrich, “The square root law of steganographic capacity,” in Proc. 10th ACM W orkshop on Multimedia and Security , Oxford, UK, Sep. 2008, pp. 107–116

    work page 2008

  13. [13]

    Fisher information determi nes capacity of ǫ-secure steganography,

    T. Filler and J. Fridrich, “Fisher information determi nes capacity of ǫ-secure steganography,” in Proc. 11th International Conference on Information Hiding , Darmstadt, Germany, Jun. 2009, pp. 31–47

    work page 2009

  14. [14]

    The capacity of wireless netwo rks,

    P . Gupta and P . R. Kumar, “The capacity of wireless netwo rks,” IEEE Transactions on Information Theory , vol. 46, no. 2, pp. 388–404, March 2000

    work page 2000

  15. [15]

    Closing the gap in the capacity of wireless networks via percolation the ory,

    M. Franceschetti, O. Dousse, D. N. C. Tse, and P . Thiran, “Closing the gap in the capacity of wireless networks via percolation the ory,” IEEE Transactions on Information Theory , vol. 53, no. 3, pp. 1009–1018, March 2007

    work page 2007

  16. [16]

    Information theoretic up per bounds on the capacity of large extended ad-hoc wireless networks,

    O. L´ evˆ eque and E. Telatar, “Information theoretic up per bounds on the capacity of large extended ad-hoc wireless networks,” i n Proc. International Symposium on Information Theory , Chicago Downtown Marriott, Chicago, USA, Jun. 2004, pp. 370–370

    work page 2004

  17. [17]

    Hierarchical cooper ation achieves optimal capacity scaling in ad hoc networks,

    A. ¨Ozg¨ ur, O. L´ evˆ eque, and D. N. C. Tse, “Hierarchical cooper ation achieves optimal capacity scaling in ad hoc networks,” IEEE Transac- tions on Information Theory , vol. 53, no. 10, pp. 3549–3572, Oct 2007

    work page 2007

  18. [18]

    On capacity scaling in arbitrary wireless networks,

    U. Niesen, P . Gupta, and D. Shah, “On capacity scaling in arbitrary wireless networks,” IEEE Transactions on Information Theory , vol. 55, no. 9, pp. 3959–3982, Sep. 2009

    work page 2009

  19. [19]

    Informati on- theoretic operating regimes of large wireless networks,

    A. ¨Ozg¨ ur, R. Johari, D. N. C. Tse, and O. L´ evˆ eque, “Informati on- theoretic operating regimes of large wireless networks,” IEEE Trans- actions on Information Theory , vol. 56, no. 1, pp. 427–437, Jan 2010

    work page 2010

  20. [20]

    Cognitive networks achieve throughput scaling of a homogeneous netwo rk,

    S.-W. Jeon, N. Devroye, M. Vu, S.-Y . Chung, and V . Tarokh , “Cognitive networks achieve throughput scaling of a homogeneous netwo rk,” IEEE Transactions on Information Theory , vol. 57, no. 8, pp. 5103–5115, Aug 2011

    work page 2011

  21. [21]

    T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) . New Y ork, NY , USA: Wiley-Interscience, 2006

    work page 2006