# TGN-MCDS: A Temporal Graph Network-Based Algorithm for Cluster-Head Optimization in Large-Scale FANETs

**Authors:** Xiangrui Fan, Yuxuan Yang, Shuo Zhang, Wenlong Cai

PMC · DOI: 10.3390/s26010347 · Sensors (Basel, Switzerland) · 2026-01-05

## TL;DR

This paper introduces TGN-MCDS, a new algorithm for optimizing cluster heads in large-scale flying ad hoc networks to improve communication stability and efficiency.

## Contribution

The novel TGN-MCDS algorithm uses temporal graph networks to efficiently solve the cluster head optimization problem in dynamic FANETs.

## Key findings

- TGN-MCDS achieves full node coverage and strong connectivity with fewer and more stable cluster heads.
- The algorithm outperforms Greedy, ILP, and BnB methods in terms of cluster stability and computational efficiency.
- Simulation results show TGN-MCDS rapidly produces near-optimal cluster head sets for large-scale FANETs.

## Abstract

With the growing deployment of Flying Ad hoc Networks (FANETs) in military and civilian applications, constructing a stable and efficient communication backbone has become a critical challenge. This paper tackles the Cluster Head (CH) optimization problem in large-scale and highly dynamic FANETs by formulating it as a Minimum Connected Dominating Set (MCDS) problem. However, since MCDS is NP-complete on general graphs, existing heuristic and exact algorithms suffer from limited coverage, poor connectivity, and high computational cost. To address these issues, we propose TGN-MCDS, a novel algorithm built upon the Temporal Graph Network (TGN) architecture, which leverages graph neural networks for cluster head selection and efficiently learns time-varying network topologies. The algorithm adopts a multi-objective loss function incorporating coverage, connectivity, size control, centrality, edge penalty, temporal smoothness, and information entropy to guide model training. Simulation results demonstrate that TGN-MCDS rapidly achieves near-optimal CH sets with full node coverage and strong connectivity. Compared with Greedy, Integer Linear Programming (ILP), and Branch-and-Bound (BnB) methods, TGN-MCDS produces fewer and more stable CHs, significantly improving cluster stability while maintaining high computational efficiency for real-time operations in large-scale FANETs.

## Full-text entities

- **Genes:** LYST (lysosomal trafficking regulator) [NCBI Gene 1130] {aka CHS, CHS1, Mauve}
- **Diseases:** TGN (MESH:C536956), FANET (MESH:C000719189), injury to (MESH:D014947), Loss (MESH:D016388), CH (MESH:D006258), MCDS (MESH:D003240)
- **Chemicals:** FANET (-)
- **Species:** Homo sapiens (human, species) [taxon 9606]

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/PMC12788238/full.md

## Figures

10 figures with captions in the complete paper: https://tomesphere.com/paper/PMC12788238/full.md

## References

31 references — full list in the complete paper: https://tomesphere.com/paper/PMC12788238/full.md

---
Source: https://tomesphere.com/paper/PMC12788238