Graph Based Routing Optimisation in 5G/6G Wireless Mesh Networks with Mixed Mobility Nodes

View at publisher Summarise with VIRAT
Authors: D Aarthi, Kodeeswari. K, Harishchander Anandaram, Ms. M. Sri Soundharyaa, S. Sowmiya, F. V. Jayasudha
Cited by: 0
References: 13

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The heterogeneity of$\mathbf{5 G} / \mathbf{6 G}$wireless mesh networks, including UAVs, vehicles, and edge devices, leads to frequent topology changes and intermittent links, both challenging the conventional routing protocols. This work proposes the GROF, Graph-based Routing Optimization Framework, a time-varying graph approach, fusing lightweight graph neural networks (GNN) with reinforcement routing for latencyminimizing, high-reliability path prediction in mixed-mobility meshes. GROF builds dynamic graphs from local link sensing, computes node embeddings by localized message passing, and selects the next hop using a distributed RL policy. Simulation results with 50-200 nodes, static to mobile ratio of 70:30, running on realistic mobility and traffic mixes, show improvement of PDR by$\sim 5-12 \%$and reduction of end-to-end delay by$20-40 \%$, as compared to AODV, OLSR, HWMP, and a DRL baseline, while reducing routing overhead and energy per delivered packet. GROF's distributed graph learning is designed for deployment at the edge and promises good scalability to denser topologies.

Fields of Study & Subjects

Mobile Ad Hoc Networks Opportunistic and Delay-Tolerant Networks Wireless Networks and Protocols

Publication details

Journal / source
International Conference on Communication, Computing and Electronics Systems (ICCCES)
Pages
188–194
Publication date
21 January 2026
Language
EN