Optimizing FANET Routing Using a Hybrid Approach of Firefly Algorithm and ACO-Lévy Flight

Abstract

Unmanned Aerial Vehicle (UAV) is an utter technological sensation that embraces the capability to hover peripatetically in the air. Multi UAV system designed on an effective but complex network needs a flying ad-hoc network (FANET) system to be employed. Due to the higher mobility degree and higher computational power FANET faces an enormous challenge in routing optimization. Other than conventional mobile ad-hoc network (MANET) protocols, metaheuristics-based Ant algorithm and Bee algorithm modifications have been developed as alternatives in FANET topology to exhibit high performance, but with limitations. A metaheuristics hybridization approach founded on Ant Colony Optimization-Levy flight and Firefly Algorithm is projected to make the AdHoc on demand distance vector (AODV) more adequate and thereby aiming in improved routing optimization in FANET system. Comparative analysis on the projected half brid algorithm and the preexisting routing algorithms (AODV and AntHocNet and BeeAdHoc) are conducted to overcome the Routing problem in FANET system.