Decentralized Covert Routing in Heterogeneous Networks Using Reinforcement Learning
On the map: Deep reinforcement learning methods → RL for energy, networks and operations
Abstract (arXiv)
This letter investigates covert routing communications in a heterogeneous network where a source transmits confidential data to a destination with the aid of relaying nodes where each transmitter judiciously chooses one modality among multiple communication modalities. We develop a novel reinforcement learning-based covert routing algorithm that finds a route from the source to the destination where each node identifies its next hop and modality only based on the local feedback information received from its neighboring nodes. We show based on numerical simulations that the proposed covert routing strategy has only negligible performance loss compared to the optimal centralized routing scheme.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in RL for energy, networks and operations, one of 15 directions in Deep reinforcement learning methods. Builds on 3 of its 20 references that are in the map. First posted on arXiv 31 Jan 2024.
Builds on
3 of 20 references.
References · 3
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025A Multi-Agent, Policy-Gradient approach to Network Routing
- 2026Transformer-Enhanced Reinforcement Learning: Fundamentals and Applications in Communication Networks
- 2024Heterogeneous Multi-Agent Reinforcement Learning for Distributed Channel Access in WLANs
- 2024Balancing Performance and Cost for Two-Hop Cooperative Communications: Stackelberg Game and Distributed Multi-Agent Reinforcement Learning
- 2025Optimization of Private Semantic Communication Performance: An Uncooperative Covert Communication Method
- 2024Near-Optimal Reinforcement Learning with Shuffle Differential Privacy
- 2026Learning Communication Between Heterogeneous Agents in Multi-Agent Reinforcement Learning for Autonomous Cyber Defence
- 2024Learning Sub-Second Routing Optimization in Computer Networks requires Packet-Level Dynamics