An Effective Routing Algorithm to Minimize the UAV Routing Time and Extend the Network Lifetime in Clustered IoT Network

Recently, unmanned aerial vehicles (UAVs) have become more popular due to their ease of adaptability and capability to carry out a variety of activities, including the delivery of services, monitoring and surveillance in military and civilian contexts.One of the most significant challenges in UAV operation is ensuring maximum network lifetime and management of their limited battery life.To solve these problems, we have proposed an effective routing algorithm that finds the best route to minimize UAV routing time and extend network lifetime.This is performed using the Ant Colony Optimization with Local Search (ACO-LS) algorithm for data collection from the clustered IoT network by UAV to ensure maximum network lifetime.It solved the routing problem in the minimum time in the presence of multiple charging stations and optimized the routing path.The simulation was carried out using various performance metrics: network lifetime (NT), energy consumption (EC), number of alive nodes (NAN), and packet delivery percentage (PDP).These parameters were compared with some existing algorithms such as Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA) and found that our proposed algorithm performs better in terms of higher NT, less EC, more NAN, and higher PDP than the existing algorithms ACO, PSO, and GA.

Authors

Publication Details

Journal
Radioengineering
Published
2025-05-19
DOI
https://doi.org/10.13164/re.2025.0342
Primary Topic
UAV Applications and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Effective Routing Algorithm to Minimize the UAV Routing Time and Extend the Network Lifetime in Clustered IoT Network

Nabajyoti Mazumdar, Avishek Nag, Hanif Zafor, Tasher Ali Sheikh
Radioengineering
UAV Applications and Optimization
article

An Effective Routing Algorithm to Minimize the UAV Routing Time and Extend the Network Lifetime in Clustered IoT Network

Nabajyoti Mazumdar, Avishek Nag, Hanif Zafor, Tasher Ali Sheikh
article en

Abstract

Recently, unmanned aerial vehicles (UAVs) have become more popular due to their ease of adaptability and capability to carry out a variety of activities, including the delivery of services, monitoring and surveillance in military and civilian contexts.One of the most significant challenges in UAV operation is ensuring maximum network lifetime and management of their limited battery life.To solve these problems, we have proposed an effective routing algorithm that finds the best route to minimize UAV routing time and extend network lifetime.This is performed using the Ant Colony Optimization with Local Search (ACO-LS) algorithm for data collection from the clustered IoT network by UAV to ensure maximum network lifetime.It solved the routing problem in the minimum time in the presence of multiple charging stations and optimized the routing path.The simulation was carried out using various performance metrics: network lifetime (NT), energy consumption (EC), number of alive nodes (NAN), and packet delivery percentage (PDP).These parameters were compared with some existing algorithms such as Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA) and found that our proposed algorithm performs better in terms of higher NT, less EC, more NAN, and higher PDP than the existing algorithms ACO, PSO, and GA.

RadioengineeringVol. 34(2)
Affordable and clean energy
Openalex Percentile: Top 86%
UAV Applications and Optimization
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.