# DeepMPR: Enhancing Opportunistic Routing in Wireless Networks through Multi-Agent Deep Reinforcement Learning

arXiv: https://arxiv.org/abs/2306.09637 · HTML: https://mlsanity.com/paper/2306.09637/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 6 of its 28 references that are in the map.
- First posted on arXiv 16 Jun 2023.

## Builds on (most cited first, 6 of 6)

- [Training language models to follow instructions with human feedback](https://mlsanity.com/paper/2203.02155/) (2022)
- [Proximal Policy Optimization Algorithms](https://mlsanity.com/paper/1707.06347/) (2017)
- [Ray: A Distributed Framework for Emerging AI Applications](https://mlsanity.com/paper/1712.05889/) (2017)
- [A Deep-Reinforcement Learning Approach for Software-Defined Networking Routing Optimization](https://mlsanity.com/paper/1709.07080/) (2017)
- [DeepCQ+: Robust and Scalable Routing with Multi-Agent Deep Reinforcement Learning for Highly Dynamic Networks](https://mlsanity.com/paper/2111.15013/) (2021)
- [Scalable Deep Reinforcement Learning for Routing and Spectrum Access in Physical Layer](https://mlsanity.com/paper/2012.11783/) (2020)

## Built on by (most cited first, 2 of 2)

- [Opportunistic Routing in Wireless Communications via Learnable State-Augmented Policies](https://mlsanity.com/paper/2503.03736/) (2025)
- [Collaborative Information Dissemination with Graph-based Multi-Agent Reinforcement Learning](https://mlsanity.com/paper/2308.16198/) (2023)

## Abstract (arXiv)

Opportunistic routing relies on the broadcast capability of wireless networks. It brings higher reliability and robustness in highly dynamic and/or severe environments such as mobile or vehicular ad-hoc networks (MANETs/VANETs). To reduce the cost of broadcast, multicast routing schemes use the connected dominating set (CDS) or multi-point relaying (MPR) set to decrease the network overhead and hence, their selection algorithms are critical. Common MPR selection algorithms are heuristic, rely on coordination between nodes, need high computational power for large networks, and are difficult to tune for network uncertainties. In this paper, we use multi-agent deep reinforcement learning to design a novel MPR multicast routing technique, DeepMPR, which is outperforming the OLSR MPR selection algorithm while it does not require MPR announcement messages from the neighbors. Our evaluation results demonstrate the performance gains of our trained DeepMPR multicast forwarding policy compared to other popular techniques.
