Multi-UAV Covert Communication with Informed Jammers: Design, Analysis and Optimization
The ability to ensure covert unmanned aerial vehicle (UAV) communications is imperative in critical missions such as military surveillance and emergency response. In this paper, a multi-UAV covert communication system with informed jammers is investigated. To increase ground wardens' detection...
        Saved in:
      
    
          | Published in | IEEE transactions on communications p. 1 | 
|---|---|
| Main Authors | , , , , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
            IEEE
    
        21.10.2025
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0090-6778 1558-0857  | 
| DOI | 10.1109/TCOMM.2025.3624167 | 
Cover
| Summary: | The ability to ensure covert unmanned aerial vehicle (UAV) communications is imperative in critical missions such as military surveillance and emergency response. In this paper, a multi-UAV covert communication system with informed jammers is investigated. To increase ground wardens' detection uncertainty, we propose a joint dynamic scheduling and sensing jamming (DSSJ) scheme. Unlike existing approaches with fixed UAV roles and non-informed jamming, DSSJ dynamically schedules UAVs across adjacent time slots (TSs), while the jamming UAV performs sensing-based informed jamming per TS. Closed-form expressions are derived for the covert rate and minimum detection error probability (MDEP) under the worst-case scenario with optimal warden detection. An optimization problem is formulated to maximize the normalized weighted sum of covert rate and MDEP, subject to multiple constraints, including scheduling, sensing ratio, and other key factors. To solve this mixed-integer non-convex problem, we design a double deep Q-network (DDQN)-DSSJ algorithm, integrating DSSJ within a deep reinforcement learning framework, accelerated by experience replay and dynamic exploration, achieving real-time covert decision-making with polynomial complexity. Simulations demonstrate that DDQN-DSSJ achieves 25% faster convergence, enhanced stability, and superior covertness compared to proximal policy optimization and deep Q-network. Additionally, DDQN-DSSJ improves the covert rate by over 4× and MDEP by up to 28.3%, outperforming state-of-the-art schemes. | 
|---|---|
| ISSN: | 0090-6778 1558-0857  | 
| DOI: | 10.1109/TCOMM.2025.3624167 |