Abstract
The exponential growth in Internet-connected devices has escalated the demand for optimized network topologies to ensure high performance. Traditional optimization methods often fall short in scalability and adaptability when it comes to network topology planning. In this paper, we address the challenge of transforming mesh topologies into tree topologies for wireless networks, with the objective of maximizing throughput. We propose two new methods: Path Selection with Rejection Strategy (PSRS), which leverages Message-Passing Neural Networks (MPNN), and Dual-Agent Tree Topology Exploration (DATTE), which employs Graph Attention Networks (GAT). These schemes integrate Deep Reinforcement Learning (DRL) and Graph Neural Networks (GNNs) to construct efficient tree topologies with the goal of maximizing the minimum throughput of the wireless network. Experimental results validate the scalability and performance gains of the proposed approaches, highlighting their potential for real-world applications.
| Original language | English |
|---|---|
| Pages (from-to) | 85447-85460 |
| Number of pages | 14 |
| Journal | IEEE Access |
| Volume | 13 |
| DOIs | |
| Publication status | Published - 2025 |
!!!Keywords
- Deep reinforcement learning
- graph neural networks
- proximal policy optimization
- tree topology
- wireless network
Fingerprint
Dive into the research topics of 'New Approaches for Network Topology Optimization Using Deep Reinforcement Learning and Graph Neural Network'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver