Betweenness Centrality Based Dynamic Source Routing for Flying Ad Hoc Networks in Marching Formation
🤖 AI Summary
To address inefficient routing in Flying Ad-hoc Networks (FANETs) under marching formation scenarios—characterized by highly dynamic topology and heterogeneous node roles—this paper proposes a Betweenness-Centrality-based Dynamic Source Routing protocol (BC-DSR). BC-DSR innovatively incorporates graph-theoretic betweenness centrality into route metric design to quantify each node’s criticality in formation information flow, and integrates a high-fidelity Leader-Follower Gaussian-Markov Group (GMG) mobility model to capture spatiotemporal correlations within the formation. Evaluated in ns-3, BC-DSR outperforms state-of-the-art FANET routing protocols: it achieves a 12.7% increase in packet delivery ratio, an 18.3% reduction in average end-to-end delay, and a 24.1% decrease in routing overhead ratio, while maintaining low network jitter. These improvements collectively enable mission-critical, efficient communication in formation-based FANETs.
Application Category
📝 Abstract
Designing high-performance routing protocols for flying ad hoc networks (FANETs) is challenging due to the diversity of applications and the dynamics of network topology. The existing general-purpose routing protocols for ad hoc networks often oversimplify mobility patterns and disregard the unequal importance of nodes, resulting in suboptimal routing decisions that are unsuitable for task-oriented FANETs. To break the bottleneck, in this paper we propose a betweenness centrality based dynamic source routing (BC-DSR) protocol for a flying ad hoc network (FANET) in marching formation. Firstly, we introduce a Gauss-Markov group (GMG) mobility model based on the leader-follower pattern, which accurately captures the temporal and spatial correlations of node movements in the realistic marching formation. Besides, we exploit the concept of BC defined in graph theory to measure the structural unequal importance of relay nodes, i.e., to determine link weights, in the particular marching formation topology. The path of least cost is calculated relying on a weighted directed graph constructed. The ns-3 based simulation results demonstrate that our BCDSR protocol achieves higher packet-delivery ratio and lower average end-to-end latency and routing overhead ratio than representative benchmark protocols used in FANETs, while maintaining a reasonably small network jitter.
Problem
Research questions and friction points this paper is trying to address.
Design routing protocols for dynamic FANETs
Address unequal node importance in marching formations
Improve packet delivery and reduce latency
Innovation
Methods, ideas, or system contributions that make the work stand out.
Uses Gauss-Markov group mobility model
Applies betweenness centrality for routing
Constructs weighted directed graph paths
🔎 Similar Papers
No similar papers found.
