Learning Ad Hoc Network Dynamics via Graph-Structured World Models
Abstract
Ad hoc wireless networks exhibit complex, innate and coupled dynamics: node mobility, energy depletion and topology change that are difficult to model analytically. Model-free deep reinforcement learning requires sustained online interaction whereas existing model based approaches use flat state representations that lose per node structure. Therefore we propose G-RSSM, a graph structured recurrent state space model that maintains per node latent states with cross node multi head attention to learn the dynamics jointly from offline trajectories. We apply the proposed method to the downstream task clustering where a cluster head selection policy trains entirely through imagined rollouts in the learned world model. Across 27 evaluation scenarios spanning MANET, VANET, FANET, WSN and tactical networks with N=30 to 1000 nodes, the learned policy maintains high connectivity with only trained for N=50. Herein, we propose the first multi physics graph structured world model applied to combinatorial per node decision making in size agnostic wireless ad hoc networks.
Cite
@article{arxiv.2604.14811,
title = {Learning Ad Hoc Network Dynamics via Graph-Structured World Models},
author = {Can Karacelebi and Yusuf Talha Sahin and Elif Surer and Ertan Onur},
journal= {arXiv preprint arXiv:2604.14811},
year = {2026}
}
Comments
6 pages, 4 figures. Submitted to the IEEE Global Communications Conference (GLOBECOM) 2026