An Energy, Mobility and Obstacle Aware Clustering based Intelligent Routing Protocol for FANET

Title

An Energy, Mobility and Obstacle Aware Clustering based Intelligent Routing Protocol for FANET

Creator

Rajeswari, J.G.; Kousalya, R.

Description

The use of Flying Adhoc Networks (FANETs), also known as Unmanned Aerial Vehicles (UAVs), has increased in recent years. However, the fast movement of UAVs can lead to unreliable links and inefficient data transmission. To address this issue, the Intelligent-based Energy and Mobility-aware Clustering (IEMC) protocol has been developed, utilizing Battle Royale Optimization (BRO) for Cluster Head (CH) selection and a Deep Q-Learning (DQL)-based fast dynamic hello interval algorithm for path maintenance. Despite these advancements, FANETs still face challenges due to environmental obstacles affecting communication routes. To solve these issues, this article proposes an Intelligent-based Energy, Mobility, and Obstacle-aware Clustering (IEMOC) protocol for FANET routing. This protocol uses an intelligent Bezier route selection technique to deal with obstacles obstructing the paths of FANET nodes and a speed-based mobility prediction technique to reduce the impact of mobility during transmission. If link failure occurs due to an obstacle in the network, the IEMOC protocol selects an optimal alternative routing path via neighboring nodes based on its mobility awareness factor, link duration, network connectivity, and route availability, recovering the failed route without initiating the route discovery process. The effectiveness of the IEMOC protocol is validated through performance evaluations using the Network Simulator (NS)-2.35, and simulation results demonstrate that the IEMOC protocol outperforms conventional routing protocols in FANETs. 2025 The Authors. Published by Elsevier B.V.

Source

Procedia Computer Science;Volume;252;pp.934-943

Date

01-01-2025

Publisher

Elsevier B.V.

Subject

FANET; IEMC protocol; Link duration; Mobility; Network connectivity; Obstacles; Optimal routing; Path availability

Coverage

Rajeswari J.G., Department of Computer Science, Dr. N.G.P. Arts and Science College, Tamilnadu, Coimbatore, India; Kousalya R., Dr. N.G.P. Arts and Science College, Christ University, Bengaluru, Tamilnadu, Coimbatore, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 18770509;

Format

online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1016/j.procs.2025.01.054

https://www.scopus.com/pages/publications/85219211675?origin=resultslist