English

Multipath Routing for Multi-Hop UAV Networks

Multiagent Systems 2026-01-16 v1

Abstract

Multi-hop uncrewed aerial vehicle (UAV) networks are promising to extend the terrestrial network coverage. Existing multi-hop UAV networks employ a single routing path by selecting the next-hop forwarding node in a hop-by-hop manner, which leads to local congestion and increases traffic delays. In this paper, a novel traffic-adaptive multipath routing method is proposed for multi-hop UAV networks, which enables each UAV to dynamically split and forward traffic flows across multiple next-hop neighbors, thus meeting latency requirements of diverse traffic flows in dynamic mobile environments. An on-time packet delivery ratio maximization problem is formulated to determine the traffic splitting ratios at each hop. This sequential decision-making problem is modeled as a decentralized partially observable Markov decision process (Dec-POMDP). To solve this Dec-POMDP, a novel multi-agent deep reinforcement leaning (MADRL) algorithm, termed Independent Proximal Policy Optimization with Dirichlet Modeling (IPPO-DM), is developed. Specifically, the IPPO serves as the core optimization framework, where the Dirichlet distribution is leveraged to parameterize a continuous stochastic policy network on the probability simplex, inherently ensuring feasible traffic splitting ratios. Simulation results demonstrate that IPPO-DM outperforms benchmark schemes in terms of both delivery latency guarantee and packet loss performance.

Keywords

Cite

@article{arxiv.2601.10299,
  title  = {Multipath Routing for Multi-Hop UAV Networks},
  author = {Zhenyu Zhao and Tiankui Zhang and Xiaoxia Xu and Junjie Li and Yuanwei Liu and Wenjuan Xing},
  journal= {arXiv preprint arXiv:2601.10299},
  year   = {2026}
}

Comments

This paper has been submitted to IEEE Transactions on Communications

R2 v1 2026-07-01T09:05:41.186Z