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 o...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Spolecnost pro radioelektronicke inzenyrstvi
2025-06-01
|
| Series: | Radioengineering |
| Subjects: | |
| Online Access: | https://www.radioeng.cz/fulltexts/2025/25_02_0342_0352.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1210-2512 |