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

Kaviani, Saeed; Ryu, Bo; Ahmed, Ejaz; Kim, Deokseong; Kim, Jae; Spiker, Carrie; Harnden, Blake

doi:10.1109/milcom58377.2023.10356325

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Book1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Collaborative Information Dissemination with Graph-Based Multi-Agent Reinforcement Learning

Galliera,

Venable,

Bassani

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Collaborative Information Dissemination with Graph-Based Multi-Agent Reinforcement Learning

Galliera,

Venable,

Bassani

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A Mobile Opportunistic Routing Algorithm Based on Mobility Classification

Tu,

Li,

Wang

2024

J CIRCUIT SYST COMP

View full text Add to dashboard Cite

The advancement of novel technologies has positioned mobile wireless networks as the central focus of computer technology research. The selection process for the subsequent relay node in message forwarding holds paramount importance and is deemed critical. Drawing inspiration from Social Mobility theory, this paper presents a pioneering node classification model that categorizes all nodes into three distinct types. Furthermore, we introduce the concept of Active Entropy, where the numerical value of Active Entropy serves as a metric for message forwarding. Consequently, the routing algorithm transforms into a limited set of strategies between nodes belonging to different types. This routing algorithm offers numerous advantages including enhanced delivery rate, reduced network overhead ratio and decreased transmission delay. We evaluate and compare the performance of our proposed algorithm with that of DFDL algorithm and Prophet algorithm on the ONE simulation platform. Experimental results demonstrate that our proposed algorithm achieves a delivery rate at least 15% higher compared to the other two algorithms while also reducing overhead ratio.

show abstract

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

Cited by 2 publications

References 13 publications

Collaborative Information Dissemination with Graph-Based Multi-Agent Reinforcement Learning

Collaborative Information Dissemination with Graph-Based Multi-Agent Reinforcement Learning

A Mobile Opportunistic Routing Algorithm Based on Mobility Classification

Contact Info

Product

Resources

About