An adaptive multipath routing algorithm based on deep reinforcement learning with delayed-reward in dynamic IoT networks
Routing optimization in dynamic networks remains a challenging problem due to the complexity of network topologies and the non-stationary nature of traffic flows. Traditional routing protocols such as RIP and ECMP often fail to fully utilize network resources under high traffic loads, while conventional reinforcement learning methods struggle to converge in complex environments. To overcome these limitations, this paper proposes a Deep Reinforcement Learning with Delayed Reward for Multi-Path Routing (MPRDRL) algorithm. In MPRDRL, each router node is modeled as an independent agent that learns to make routing decisions based on local observations. Unlike prior reinforcement learning approaches that rely on instantaneous rewards, our method introduces a path-based delayed reward mechanism that evaluates the global transmission performance of each packet upon arrival at its destination, allowing agents to more accurately evaluate their actions based on long-term outcomes. Under experimental scenarios, MPRDRL outperforms various baselines in terms of end-to-end delay and maximum link utilization.
Authors
- Tan Chen (ORCID: https://orcid.org/0009-0004-8049-1774)
- Xin Xiong (ORCID: https://orcid.org/0000-0001-9955-9389)
- Xingtian Ren (ORCID: https://orcid.org/0000-0003-3919-2970)
- C.C. Wu
Institutions
- Beijing University of Technology (CN)
- Beijing City University (CN)
Publication Details
- Published
- 2025-10-13
- DOI
- https://doi.org/10.1117/12.3084042
- Primary Topic
- Software-Defined Networks and 5G
- Type
- article
- Field-Weighted Citation Impact
- 0.00