.png){kind=icon}
.png){kind=icon}
Return
Game-Based Mobility-Aware Distributed Clustering Routing Protocol for UAV Ad Hoc Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/tvt.2026.3678784.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
While decentralization and self-organization endow unmanned aerial vehicle (UAV) ad hoc networks with strong capabilities of collaboration, robustness and flexible deployment, the limited energy of UAVs imposes more stringent requirements on routing protocol design. To address the challenges of frequent link disruptions and uneven energy consumption caused by high node mobility, this paper proposes a game-based mobility-aware distributed clustering (GMDC) routing protocol. First, node mobility is regarded as the primary factor, and a mobility similarity metric based on position and velocity is introduced. An efficient mobility-aware adaptive clustering algorithm is developed to accomplish node clustering. Second, a non-cooperative mixed-strategy game model is constructed within each cluster, where energy, distance to the cluster centroid, the cluster head nomination count and connectivity with neighboring clusters are jointly considered for electing cluster heads and gateways. Finally, a dynamic cluster maintenance mechanism based on periodic detection is established, in which bidirectional state confirmation is achieved through periodic broadcasts of maintenance messages by cluster heads and timely responses from cluster members, thereby ensuring stable communication. Simulation results demonstrate that, compared with K-means, WCA and GDCR, GMDC consistently achieves the longest network lifetime, a more stable topology, and faster topology construction as the number of nodes increases and mobility heterogeneity intensifies.
Keywords:
UAV ad hoc networks
clustering routing
mobility similarity
mixed-strategy game
cluster maintenance
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
View more organizations