A swarm driven clustering and energy smart routing in FANET environment

A Flying Ad Hoc Network (FANET) enables communication among UAVs using a cluster-based architecture, where UAV nodes transmit data to designated CHs that aggregate information and manage inter-cluster communication. However, existing FANET systems still face challenges such as high communication delay and increased energy consumption in large-scale and highly dynamic environments. So, this paper proposes an OSCER-FANET, which supports efficient information flow across expanding networks by lowering control traffic and sustaining dependable communication despite frequent node mobility. The OSCER-FANET is designed to achieve efficient and reliable data transmission through a multi-stage optimization framework. The OSCER-FANET process begins with network clustering using the KFCM algorithm, which effectively groups UAV nodes while accounting for uncertainty and mobility. Following clustering, OCHS is done using a BFA-GGO algorithm based on constraints such as residual energy, inter-cluster distance, intra-cluster distance and cluster load balancing. Subsequently, the BFA-GGO algorithm is used to optimize routing paths, improving network lifetime, delay, packet delivery ratio and throughput. It achieves higher residual energy (0.56 J) and lower delay (0.167 s) over 2000 rounds. Its statistical significance is validated using Friedman, t-test and Wilcoxon tests at significance level of 0.05.

Authors

Institutions

Publication Details

Journal
Discover Artificial Intelligence
Published
2026-11-19
DOI
https://doi.org/10.1007/s44163-026-02740-9
Primary Topic
Mobile Ad Hoc Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A swarm driven clustering and energy smart routing in FANET environment

Dipika Pawar, Vijay Omprakash Rathi, Shrikant D. Dhamdhere, Pramod B. Dhamdhere et al.
Discover Artificial Intelligence
Mobile Ad Hoc Networks
article

A swarm driven clustering and energy smart routing in FANET environment

Dipika Pawar, Vijay Omprakash Rathi, Shrikant D. Dhamdhere, Pramod B. Dhamdhere, Kiran Pandhari Gaikwad
article en

Abstract

A Flying Ad Hoc Network (FANET) enables communication among UAVs using a cluster-based architecture, where UAV nodes transmit data to designated CHs that aggregate information and manage inter-cluster communication. However, existing FANET systems still face challenges such as high communication delay and increased energy consumption in large-scale and highly dynamic environments. So, this paper proposes an OSCER-FANET, which supports efficient information flow across expanding networks by lowering control traffic and sustaining dependable communication despite frequent node mobility. The OSCER-FANET is designed to achieve efficient and reliable data transmission through a multi-stage optimization framework. The OSCER-FANET process begins with network clustering using the KFCM algorithm, which effectively groups UAV nodes while accounting for uncertainty and mobility. Following clustering, OCHS is done using a BFA-GGO algorithm based on constraints such as residual energy, inter-cluster distance, intra-cluster distance and cluster load balancing. Subsequently, the BFA-GGO algorithm is used to optimize routing paths, improving network lifetime, delay, packet delivery ratio and throughput. It achieves higher residual energy (0.56 J) and lower delay (0.167 s) over 2000 rounds. Its statistical significance is validated using Friedman, t-test and Wilcoxon tests at significance level of 0.05.

Discover Artificial IntelligenceVol. 6(1)
JSPM University (IN)
Mobile Ad Hoc Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon