Dual-Graph Multi-Agent Reinforcement Learning for Handover Optimization

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Salvatori, Matteo, Vannella, Filippo, Macaluso, Sebastian, Trevlakis, Stylianos E., Perales, Carlos Segura, Suarez-Varela, José, Boulogeorgos, Alexandros-Apostolos A., Arapakis, Ioannis
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915891558481920
author Salvatori, Matteo
Vannella, Filippo
Macaluso, Sebastian
Trevlakis, Stylianos E.
Perales, Carlos Segura
Suarez-Varela, José
Boulogeorgos, Alexandros-Apostolos A.
Arapakis, Ioannis
author_facet Salvatori, Matteo
Vannella, Filippo
Macaluso, Sebastian
Trevlakis, Stylianos E.
Perales, Carlos Segura
Suarez-Varela, José
Boulogeorgos, Alexandros-Apostolos A.
Arapakis, Ioannis
contents HandOver (HO) control in cellular networks is governed by a set of HO control parameters that are traditionally configured through rule-based heuristics. A key parameter for HO optimization is the Cell Individual Offset (CIO), defined for each pair of neighboring cells and used to bias HO triggering decisions. At network scale, tuning CIOs becomes a tightly coupled problem: small changes can redirect mobility flows across multiple neighbors, and static rules often degrade under non-stationary traffic and mobility. We exploit the pairwise structure of CIOs by formulating HO optimization as a Decentralized Partially Observable Markov Decision Process (Dec-POMDP) on the network's dual graph. In this representation, each agent controls a neighbor-pair CIO and observes Key Performance Indicators (KPIs) aggregated over its local dual-graph neighborhood, enabling scalable decentralized decisions while preserving graph locality. Building on this formulation, we propose TD3-D-MA, a discrete Multi-Agent Reinforcement Learning (MARL) variant of the TD3 algorithm with a shared-parameter Graph Neural Network (GNN) actor operating on the dual graph and region-wise double critics for training, improving credit assignment in dense deployments. We evaluate TD3-D-MA in an ns-3 system-level simulator configured with real-world network operator parameters across heterogeneous traffic regimes and network topologies. Results show that TD3-D-MA improves network throughput over standard HO heuristics and centralized RL baselines, and generalizes robustly under topology and traffic shifts.
format Preprint
id arxiv_https___arxiv_org_abs_2603_24634
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Dual-Graph Multi-Agent Reinforcement Learning for Handover Optimization
Salvatori, Matteo
Vannella, Filippo
Macaluso, Sebastian
Trevlakis, Stylianos E.
Perales, Carlos Segura
Suarez-Varela, José
Boulogeorgos, Alexandros-Apostolos A.
Arapakis, Ioannis
Networking and Internet Architecture
Artificial Intelligence
Machine Learning
HandOver (HO) control in cellular networks is governed by a set of HO control parameters that are traditionally configured through rule-based heuristics. A key parameter for HO optimization is the Cell Individual Offset (CIO), defined for each pair of neighboring cells and used to bias HO triggering decisions. At network scale, tuning CIOs becomes a tightly coupled problem: small changes can redirect mobility flows across multiple neighbors, and static rules often degrade under non-stationary traffic and mobility. We exploit the pairwise structure of CIOs by formulating HO optimization as a Decentralized Partially Observable Markov Decision Process (Dec-POMDP) on the network's dual graph. In this representation, each agent controls a neighbor-pair CIO and observes Key Performance Indicators (KPIs) aggregated over its local dual-graph neighborhood, enabling scalable decentralized decisions while preserving graph locality. Building on this formulation, we propose TD3-D-MA, a discrete Multi-Agent Reinforcement Learning (MARL) variant of the TD3 algorithm with a shared-parameter Graph Neural Network (GNN) actor operating on the dual graph and region-wise double critics for training, improving credit assignment in dense deployments. We evaluate TD3-D-MA in an ns-3 system-level simulator configured with real-world network operator parameters across heterogeneous traffic regimes and network topologies. Results show that TD3-D-MA improves network throughput over standard HO heuristics and centralized RL baselines, and generalizes robustly under topology and traffic shifts.
title Dual-Graph Multi-Agent Reinforcement Learning for Handover Optimization
topic Networking and Internet Architecture
Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2603.24634