pith. sign in

arxiv: 1906.08438 · v1 · pith:7MWLSSHXnew · submitted 2019-06-20 · 📡 eess.SP

UAV-Enabled Covert Wireless Data Collection

Xiaobo Zhou , Shihao Yan , Feng Shu , Riqing Chen , Jun Li This is my paper

Pith reviewed 2026-05-25 19:45 UTC · model grok-4.3

classification 📡 eess.SP
keywords UAVcovert communicationdata collectiontrajectory optimizationartificial noiseuser schedulingsuccessive convex approximationmax-min rate
0
0 comments X

The pith

Joint optimization of UAV trajectory, AN power and scheduling raises max-min covert transmission rates.

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

This paper addresses covert data collection in UAV networks where a full-duplex UAV collects information from scheduled ground users while transmitting artificial noise with random power to mask the transmissions from unscheduled users. The goal is to maximize the minimum average rate across users by jointly optimizing the UAV trajectory, the maximum AN power, and the scheduling decisions, all while satisfying a covertness constraint based on the detection performance at each unscheduled user and practical flight limits. The problem is a mixed-integer non-convex optimization solved using a penalty successive convex approximation scheme, initialized with a successive hover-and-fly trajectory that also serves as a benchmark. A sympathetic reader would care because this enables more efficient secret data gathering from distributed sensors using aerial platforms without risking detection.

Core claim

The developed P-SCA scheme significantly outperforms the benchmark scheme in terms of achieving a higher max-min average transmission rate from all the SUs to the UAV by jointly designing the UAV's trajectory and its maximum AN transmit power together with the user scheduling strategy subject to a covertness constraint explicitly determined by analyzing each USU's detection performance.

What carries the argument

Penalty successive convex approximation (P-SCA) scheme applied to the mixed-integer non-convex problem of trajectory design, maximum artificial noise power, and binary user scheduling under the covertness constraint from unscheduled user detection analysis.

If this is right

  • The max-min average transmission rate from scheduled users to the UAV increases compared to the successive hover-and-fly benchmark.
  • The joint design maintains the covertness constraint ensuring negligible detection probability.
  • Practical UAV flight constraints are incorporated into the optimization.
  • User scheduling is integrated with trajectory and power optimization for better performance.

Where Pith is reading between the lines

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

  • The approach may extend to multi-UAV setups for collecting data over larger areas while maintaining covertness.
  • Validation through field experiments with actual radio receivers could confirm if the theoretical detection analysis holds in practice.
  • Similar random-power noise techniques could enhance covertness in other mobile communication systems.
  • Alternative initialization methods beyond SHAF might further improve the optimization results.

Load-bearing premise

The covertness constraint derived from analyzing each USU's detection performance remains valid and enforceable under the random AN transmit power model and the practical flight constraints.

What would settle it

An experiment measuring the empirical detection probability at unscheduled users during UAV flights with the optimized trajectory and power settings; if this probability exceeds the negligible threshold used in the design, the optimization guarantee fails.

Figures

Figures reproduced from arXiv: 1906.08438 by Feng Shu, Jun Li, Riqing Chen, Shihao Yan, Xiaobo Zhou.

Figure 1
Figure 1. Figure 1: Covert communications in the context of UAV data coll [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: UAV’s trajectories achieved by the P-SCA amd BM schem [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The UAV’s transmit power and speed for different valu [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: UAV’s trajectories and the maximum AN transmit power [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Max-min ATR (i.e., average transmission rate) achie [PITH_FULL_IMAGE:figures/full_fig_p011_6.png] view at source ↗
read the original abstract

This work considers unmanned aerial vehicle (UAV) networks for collecting data covertly from ground users. The full-duplex UAV intends to gather critical information from a scheduled user (SU) through wireless communication and generate artificial noise (AN) with random transmit power in order to ensure a negligible probability of the SU's transmission being detected by the unscheduled users (USUs). To enhance the system performance, we jointly design the UAV's trajectory and its maximum AN transmit power together with the user scheduling strategy subject to practical constraints, e.g., a covertness constraint, which is explicitly determined by analyzing each USU's detection performance, and a binary constraint induced by user scheduling. The formulated design problem is a mixed-integer non-convex optimization problem, which is challenging to solve directly, but tackled by our developed penalty successive convex approximation (P-SCA) scheme. An efficient UAV trajectory initialization is also presented based on the Successive Hover-and-Fly (SHAF) trajectory, which also serves as a benchmark scheme. Our examination shows the developed P-SCA scheme significantly outperforms the benchmark scheme in terms of achieving a higher max-min average transmission rate from all the SUs to the UAV.

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

Summary. The manuscript considers a full-duplex UAV collecting data covertly from scheduled ground users (SUs) while emitting artificial noise (AN) with random transmit power to keep detection probability negligible at unscheduled users (USUs). It jointly optimizes UAV trajectory, maximum AN power, and binary user scheduling to maximize the minimum average transmission rate subject to a covertness constraint (derived from per-USU detection analysis), flight constraints, and power limits. The resulting mixed-integer non-convex problem is solved via a penalty successive convex approximation (P-SCA) algorithm, which is shown to outperform a Successive Hover-and-Fly (SHAF) benchmark trajectory in numerical results.

Significance. If the covertness constraint remains valid under the joint solution, the work supplies a concrete numerical method for trajectory and power design in covert UAV data collection, extending standard SCA techniques to a mixed-integer setting with an explicit detection-derived constraint. The SHAF initialization and benchmark comparison provide a reproducible baseline.

major comments (2)
  1. [Covertness constraint derivation and § on detection performance analysis] The covertness constraint is stated to be 'explicitly determined by analyzing each USU's detection performance,' yet the system model uses random AN transmit power (producing a mixture observation at each USU) together with time-varying path loss induced by the optimized trajectory. The detection-probability expressions or approximations used to enforce the constraint must be shown to remain valid under this mixture and under the final trajectory; otherwise the optimized schedule can violate the negligible-detection premise that underpins the central performance claim.
  2. [P-SCA algorithm description and numerical results section] The P-SCA procedure applies successive convex approximations to the non-convex rate and covertness expressions. No explicit verification is provided that the sequence of approximate problems preserves feasibility of the original covertness constraint (or that the final solution satisfies the detection probability threshold after substitution of the random-power distribution and the obtained trajectory). Without such a check or post-hoc Monte-Carlo validation of realized detection probability, the claim that P-SCA 'significantly outperforms the benchmark while satisfying the covertness constraint' rests on an unverified assumption.
minor comments (2)
  1. [System model] Notation for the random AN power distribution and its effect on the hypothesis test at USUs should be introduced earlier and used consistently when the covertness constraint is first written.
  2. [Numerical results] Figure captions for the rate-versus-power or rate-versus-trajectory plots should explicitly state whether the plotted curves already incorporate the final random-power distribution or only the maximum AN power.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments on the validity of the covertness constraint and the P-SCA feasibility preservation. We address each point below and will revise the manuscript accordingly to strengthen the presentation.

read point-by-point responses

  1. Referee: [Covertness constraint derivation and § on detection performance analysis] The covertness constraint is stated to be 'explicitly determined by analyzing each USU's detection performance,' yet the system model uses random AN transmit power (producing a mixture observation at each USU) together with time-varying path loss induced by the optimized trajectory. The detection-probability expressions or approximations used to enforce the constraint must be shown to remain valid under this mixture and under the final trajectory; otherwise the optimized schedule can violate the negligible-detection premise that underpins the central performance claim.

    Authors: The detection analysis in Section III derives the covertness constraint by explicitly modeling the mixture distribution at each USU induced by the random AN power (with the maximum power as an optimization variable) and the instantaneous path loss. The resulting constraint is enforced at every time slot using the worst-case path loss over the trajectory segment to guarantee the detection probability remains below the threshold regardless of the final optimized path. We agree that the manuscript would benefit from an expanded subsection that reproduces the closed-form mixture expressions and includes a short argument showing that the per-slot enforcement carries over to the joint trajectory solution. We will add this material and a brief Monte-Carlo verification plot in the revised version. revision: yes

  2. Referee: [P-SCA algorithm description and numerical results section] The P-SCA procedure applies successive convex approximations to the non-convex rate and covertness expressions. No explicit verification is provided that the sequence of approximate problems preserves feasibility of the original covertness constraint (or that the final solution satisfies the detection probability threshold after substitution of the random-power distribution and the obtained trajectory). Without such a check or post-hoc Monte-Carlo validation of realized detection probability, the claim that P-SCA 'significantly outperforms the benchmark while satisfying the covertness constraint' rests on an unverified assumption.

    Authors: The successive convex approximations employed in the P-SCA algorithm are constructed to be conservative with respect to the original covertness constraint (via first-order Taylor lower bounds on the concave parts of the detection probability), thereby preserving feasibility at each iteration. Nevertheless, we acknowledge that the current manuscript does not explicitly state this property nor provide post-optimization validation. In the revision we will add a short paragraph in Section IV-B explaining the conservative nature of the approximations and include, in the numerical results, Monte-Carlo simulations that recompute the empirical detection probability for the final trajectory and power values to confirm that the threshold is met. revision: yes

Circularity Check

0 steps flagged

No circularity; standard optimization with externally derived constraint

full rationale

The paper formulates a mixed-integer non-convex problem maximizing min average rate subject to a covertness constraint (explicitly obtained by analyzing each USU's detection performance under the random-AN model) plus trajectory and scheduling constraints. It is solved numerically via the authors' P-SCA algorithm and benchmarked against SHAF. No step equates a claimed prediction or first-principles result to its own fitted inputs by construction, no load-bearing self-citation chain is invoked, and the covertness expression is presented as derived from standard hypothesis testing rather than renamed or self-referentially defined. The derivation chain therefore remains independent of the numerical solution it produces.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard convex optimization assumptions (e.g., successive convexification preserves feasibility) and the modeling assumption that random AN power yields a quantifiable detection probability that can be turned into a hard constraint; no free parameters or invented entities are explicitly introduced in the abstract.

axioms (2)
  • domain assumption Successive convex approximation yields a feasible and near-optimal solution to the original mixed-integer non-convex problem
    Invoked when stating that the P-SCA scheme solves the formulated design problem
  • domain assumption Each USU's detection performance can be explicitly analyzed to produce a valid covertness constraint
    Stated in the abstract as the basis for the covertness constraint

pith-pipeline@v0.9.0 · 5742 in / 1455 out tokens · 27667 ms · 2026-05-25T19:45:10.343985+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

36 extracted references · 36 canonical work pages · 1 internal anchor

  1. [1]

    Wireless communication s with unmanned aerial vehicles: opportunities and challenges,

    Y . Zeng, R. Zhang, and T. J. Lim, “Wireless communication s with unmanned aerial vehicles: opportunities and challenges,” IEEE Commun. Mag., vol. 54, no. 5, pp. 36–42, May 2016

    work page 2016

  2. [2]

    Joint traj ectory and power optimization for UA V relay networks,

    S. Zhang, H. Zhang, Q. He, K. Bian, and L. Song, “Joint traj ectory and power optimization for UA V relay networks,” IEEE Commun. Lett. , vol. 22, no. 1, pp. 161–164, Jan. 2018. 12

    work page 2018

  3. [3]

    Capacity characterization of UA V-enabled two-user broadcast channel,

    Q. Wu, J. Xu, and R. Zhang, “Capacity characterization of UA V-enabled two-user broadcast channel,” IEEE J. Sel. Areas in Commun. , vol. 36, no. 9, pp. 1955–1971, Sep. 2018

    work page 1955

  4. [4]

    Common throughput maximization in UA V- enabled OFDMA systems with delay consideration,

    Q. Wu and R. Zhang, “Common throughput maximization in UA V- enabled OFDMA systems with delay consideration,” IEEE Trans. Com- mun., vol. 66, no. 12, pp. 6614–6627, Dec. 2018

    work page 2018

  5. [5]

    Energy-efficient data col lection in UA V enabled wireless sensor network,

    C. Zhan, Y . Zeng, and R. Zhang, “Energy-efficient data col lection in UA V enabled wireless sensor network,” IEEE Wireless Commun. Lett. , vol. 7, no. 3, pp. 328–331, Jun. 2018

    work page 2018

  6. [6]

    Securing UA V commun i- cations via joint trajectory and power control,

    G. Zhang, Q. Wu, M. Cui, and R. Zhang, “Securing UA V commun i- cations via joint trajectory and power control,” IEEE Trans. Wireless Commun., vol. 18, no. 2, pp. 1376–1389, Feb. 2019

    work page 2019

  7. [7]

    UA V-enabled cooperative jamm ing for improving secrecy of ground wiretap channel,

    A. Li, Q. Wu, and R. Zhang, “UA V-enabled cooperative jamm ing for improving secrecy of ground wiretap channel,” IEEE Wireless Commun. Let., vol. 8, no. 1, pp. 181–184, Feb. 2019

    work page 2019

  8. [8]

    Improving physical layer security via a UA V friendly jamme r for unknown eavesdropper location,

    Y . Zhou, P . L. Y eoh, H. Chen, Y . Li, R. Schober, L. Zhuo, andB. Vucetic, “Improving physical layer security via a UA V friendly jamme r for unknown eavesdropper location,” IEEE Trans. V eh. Technol., Sep. 2018

    work page 2018

  9. [9]

    UA V-enabled secu re communications: Joint trajectory and transmit power optim ization,

    X. Zhou, Q. Wu, S. Y an, F. Shu, and J. Li, “UA V-enabled secu re communications: Joint trajectory and transmit power optim ization,” IEEE Trans. V eh. Technol., vol. 68, no. 4, pp. 4069–4073, Apr. 2019

    work page 2019

  10. [10]

    Dual-UA V-en abled secure communications: Joint trajectory design and user sc heduling,

    Y . Cai, F. Cui, Q. Shi, M. Zhao, and G. Y . Li, “Dual-UA V-en abled secure communications: Joint trajectory design and user sc heduling,” IEEE Journal on Selected Areas in Communications , vol. 36, no. 9, pp. 1972–1985, Sep. 2018

    work page 1972

  11. [11]

    Improving physica l layer security using UA V-enabled mobile relaying,

    Q. Wang, Z. Chen, W. Mei, and J. Fang, “Improving physica l layer security using UA V-enabled mobile relaying,” IEEE Wireless Commun. Lett., vol. 6, no. 3, pp. 310–313, Jun. 2017

    work page 2017

  12. [12]

    Joint optimiza tion of a UA V’s trajectory and transmit power for covert communicat ions,

    X. Zhou, S. Y an, J. Hu, J. Sun, and F. Shu, “Joint optimiza tion of a UA V’s trajectory and transmit power for covert communicat ions,” Available: https://arxiv.org/abs/1812.00583

    work page arXiv

  13. [13]

    Hiding un manned aerial vehicles for wireless transmissions by covert communicati ons,

    S. Y an, S. Hanly, I. Collings, and D. Goeckel, “Hiding un manned aerial vehicles for wireless transmissions by covert communicati ons,” in Proc. IEEE ICC , May 2019, pp. 1–6

    work page 2019

  14. [14]

    Low Probability of Detection Communication: Opportunities and Challenges

    S. Y an, X. Zhou, J. Hu, and S. Hanly, “Low probability of d etection com- munication: Opportunities and challenges,” Accepted by IEEE Wireless Commun., Available:https://arxiv.org/pdf/1906.07895.pdf

    work page internal anchor Pith review Pith/arXiv arXiv 1906

  15. [15]

    Limits of reliab le communi- cation with low probability of detection on AWGN channels,

    B. A. Bash, D. Goeckel, and D. Towsley, “Limits of reliab le communi- cation with low probability of detection on AWGN channels,” IEEE J. Sel. Areas Commun. , vol. 31, no. 9, pp. 1921–1930, Sep. 2013

    work page 1921

  16. [16]

    D elay- intolerant covert communications with either fixed or rando m transmit power,

    S. Y an, B. He, X. Zhou, Y . Cong, and A. L. Swindlehurst, “D elay- intolerant covert communications with either fixed or rando m transmit power,” IEEE Trans. Inf. F orensics Security, vol. 14, no. 1, pp. 129–140, Jan. 2019

    work page 2019

  17. [17]

    Delay-constrained cove rt communi- cations with a full-duplex receiver,

    F. Shu, T. Xu, J. Hu, and S. Y an, “Delay-constrained cove rt communi- cations with a full-duplex receiver,” IEEE Wireless Commun. Lett. , to be published, 2019

    work page 2019

  18. [18]

    Achi eving covert wireless communications using a full-duplex receiver,

    K. Shahzad, X. Zhou, S. Y an, J. Hu, F. Shu, and J. Li, “Achi eving covert wireless communications using a full-duplex receiver,” IEEE Trans. Wireless Commun., vol. 17, no. 12, pp. 8517–8530, Dec. 2018

    work page 2018

  19. [19]

    Covert com munications when the warden does not know the background noise power,

    D. Goeckel, B. Bash, S. Guha, and D. Towsley, “Covert com munications when the warden does not know the background noise power,” IEEE Commun. Lett. , vol. 20, no. 2, pp. 236–239, Feb. 2016

    work page 2016

  20. [20]

    On covert communi cation with noise uncertainty,

    B. He, S. Y an, X. Zhou, and V . K. N. Lau, “On covert communi cation with noise uncertainty,” IEEE Commun. Lett. , vol. 21, no. 4, pp. 941– 944, Apr. 2017

    work page 2017

  21. [21]

    Covert wirele ss communica- tion with a poisson field of interferers,

    B. He, S. Y an, X. Zhou, and H. Jafarkhani, “Covert wirele ss communica- tion with a poisson field of interferers,” IEEE Trans. Wireless Commun., vol. 17, no. 9, pp. 6005–6017, Sep. 2018

    work page 2018

  22. [22]

    Covert c ommuni- cation achieved by a greedy relay in wireless networks,

    J. Hu, S. Y an, X. Zhou, F. Shu, J. Li, and J. Wang, “Covert c ommuni- cation achieved by a greedy relay in wireless networks,” IEEE Trans. Wireless Commun., vol. 17, no. 7, pp. 4766–4779, Jul. 2018

    work page 2018

  23. [23]

    Relaying via cooperative jamming in cover t wireless communications,

    K. Shahzad, “Relaying via cooperative jamming in cover t wireless communications,” in Proc. IEEE ICSPCS , Dec. 2018, pp. 1–6

    work page 2018

  24. [24]

    Covert communication in backsc atter radio,

    K. Shahzad and X. Zhou, “Covert communication in backsc atter radio,” in Proc. IEEE ICC , May 2019, pp. 1–6

    work page 2019

  25. [25]

    Multi-antenn a covert communications in random wireless networks,

    T. Zheng, H. Wang, D. W. K. Ng, and J. Y uan, “Multi-antenn a covert communications in random wireless networks,” IEEE Trans. Wireless Commun., vol. 18, no. 3, pp. 1974–1987, Mar. 2019

    work page 1974

  26. [26]

    Gaussian signall ing for covert communications,

    S. Y an, Y . Cong, S. Hanly, and X. Zhou, “Gaussian signall ing for covert communications,” IEEE Trans. Wireless Commun. , to be published, 2019

    work page 2019

  27. [27]

    UA V- assisted data gathering in wireless sensor networks,

    K. Dong, Mianxiongand Ota, M. Lin, Z. Tang, S. Du, and H. Z hu, “UA V- assisted data gathering in wireless sensor networks,” J. Supercomput. , vol. 70, no. 3, pp. 1142–1155, Dec. 2014

    work page 2014

  28. [28]

    Flight time mini mization of UA V for data collection over wireless sensor networks,

    J. Gong, T. Chang, C. Shen, and X. Chen, “Flight time mini mization of UA V for data collection over wireless sensor networks,” IEEE J. Sel. Areas Commun. , vol. 36, no. 9, pp. 1942–1954, Sep. 2018

    work page 1942

  29. [29]

    Joint trajectory and commu nication design for multi-UA V enabled wireless networks,

    Q. Wu, Y . Zeng, and R. Zhang, “Joint trajectory and commu nication design for multi-UA V enabled wireless networks,” IEEE Trans. Wireless Commun., vol. 17, no. 3, pp. 2109–2121, Mar. 2018

    work page 2018

  30. [30]

    Covert communication in the presence of an uninformed jammer,

    T. V . Sobers, B. A. Bash, S. Guha, D. Towsley, and D. Goeck el, “Covert communication in the presence of an uninformed jammer,” IEEE Trans. Wireless Commun., vol. 16, no. 9, pp. 6193–6206, Sep. 2017

    work page 2017

  31. [31]

    Covert transmission w ith a self- sustained relay,

    J. Hu, S. Y an, F. Shu, and J. Wang, “Covert transmission w ith a self- sustained relay,” IEEE Trans. Wireless Commun. , to be published, 2019

    work page 2019

  32. [32]

    Weighted max-min fairn ess for C-RAN multicasting under limited fronthaul constraints,

    Q. Vu, K. Nguyen, and M. Juntti, “Weighted max-min fairn ess for C-RAN multicasting under limited fronthaul constraints,” IEEE Trans. Commun., vol. 66, no. 4, pp. 1534–1548, Apr. 2018

    work page 2018

  33. [33]

    V ariations and extension of the con vex-concave procedure,

    T. Lipp and S. Boyd, “V ariations and extension of the con vex-concave procedure,” Optim. Eng. , vol. 17, no. 2, pp. 263–287, Jun. 2016

    work page 2016

  34. [34]

    Max-min fairness for mu lticast multigroup multicell transmission under backhaul constra ints,

    Q. Vu, K. Nguyen, and M. Juntti, “Max-min fairness for mu lticast multigroup multicell transmission under backhaul constra ints,” in Proc. IEEE Global Commun. Conf. , Dec. 2016, pp. 1–6

    work page 2016

  35. [35]

    Boyd and L

    S. Boyd and L. V andenberghe, Convex Optimization. Cambridge U.K.: Cambridge Univ. Press, 2004

    work page 2004

  36. [36]

    The traveling salesman problem: An overvi ew of exact and approximate algorithms,

    G. Laporte, “The traveling salesman problem: An overvi ew of exact and approximate algorithms,” Eur . J. Oper . Res., vol. 59, no. 2, pp. 231–247, 1992

    work page 1992