Spectral reinforcement learning based dynamic routing for unmanned aerial vehicle (UAV) networks

Unmanned Aerial Vehicles (UAVs) have received a lot of interest for their prospective uses in various types of disciplines, including communication, disaster management, surveillance, and military applications. UAV ad-hoc networks enable UAVs to interact wirelessly without a permanent infrastructure, making them suited for many circumstances. Conventional methods require predefining the number of clusters, which can lead to inaccurate results, and existing schemes focus on distance as the key parameter while neglecting UAV connectivity; additionally, traditional algorithms struggle with complex UAV network structures due to varying distances, obstacles, and dynamic configurations, making them unable to adapt to frequent changes in connectivity, signal strength, and network topology. This study proposes a framework that integrates spectral clustering and reinforcement learning to optimize the performance of UAV ad hoc networks. Spectral clustering groups UAVs with similar communication characteristics, such as signal strength and geographic location. Reinforcement learning is then used to optimize the path UAVs take within each clustered group, leading to further improvements in network performance. Our approach effectively adapts to changes in network topology and communication patterns, allowing for optimal performance even in dynamic environments. Experimental results demonstrate the effectiveness of our strategy, achieving a Packet Delivery Ratio (PDR) improvement of approximately 18.42% over k-means routing at high mobility scenarios, with an end-to-end delay reduction of around 40% compared to traditional methods. Additionally, the Network Routing Load (NRL) of our proposed scheme remains consistently below 18%, indicating enhanced efficiency compared to existing protocols, which can reach NRL values of up to 35%. Our approach optimizes the communication efficiency of UAV ad-hoc networks by adopting an optimal route policy, resulting in reduced end-to-end delay and improved packet delivery ratio. The proposed framework offers several advantages over existing methods, including adaptability to changes in network topology and communication patterns, efficient communication, and optimal routing decisions.

Authors

Institutions

Publication Details

Journal
Computer Networks
Published
2025-10-15
DOI
https://doi.org/10.1016/j.comnet.2025.111787
Citations
1
Primary Topic
UAV Applications and Optimization
Type
article
Field-Weighted Citation Impact
4.99

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Spectral reinforcement learning based dynamic routing for unmanned aerial vehicle (UAV) networks

Khalid Hussain Mohammadani, Saif Ullah, Muhammad Faheem, Nisar Ahmed Memon
1 citations
Computer Networks
UAV Applications and Optimization
4.99
article

Spectral reinforcement learning based dynamic routing for unmanned aerial vehicle (UAV) networks

Khalid Hussain Mohammadani, Saif Ullah, Muhammad Faheem, Nisar Ahmed Memon
article en
1 citations

Abstract

Unmanned Aerial Vehicles (UAVs) have received a lot of interest for their prospective uses in various types of disciplines, including communication, disaster management, surveillance, and military applications. UAV ad-hoc networks enable UAVs to interact wirelessly without a permanent infrastructure, making them suited for many circumstances. Conventional methods require predefining the number of clusters, which can lead to inaccurate results, and existing schemes focus on distance as the key parameter while neglecting UAV connectivity; additionally, traditional algorithms struggle with complex UAV network structures due to varying distances, obstacles, and dynamic configurations, making them unable to adapt to frequent changes in connectivity, signal strength, and network topology. This study proposes a framework that integrates spectral clustering and reinforcement learning to optimize the performance of UAV ad hoc networks. Spectral clustering groups UAVs with similar communication characteristics, such as signal strength and geographic location. Reinforcement learning is then used to optimize the path UAVs take within each clustered group, leading to further improvements in network performance. Our approach effectively adapts to changes in network topology and communication patterns, allowing for optimal performance even in dynamic environments. Experimental results demonstrate the effectiveness of our strategy, achieving a Packet Delivery Ratio (PDR) improvement of approximately 18.42% over k-means routing at high mobility scenarios, with an end-to-end delay reduction of around 40% compared to traditional methods. Additionally, the Network Routing Load (NRL) of our proposed scheme remains consistently below 18%, indicating enhanced efficiency compared to existing protocols, which can reach NRL values of up to 35%. Our approach optimizes the communication efficiency of UAV ad-hoc networks by adopting an optimal route policy, resulting in reduced end-to-end delay and improved packet delivery ratio. The proposed framework offers several advantages over existing methods, including adaptability to changes in network topology and communication patterns, efficient communication, and optimal routing decisions.

Computer NetworksVol. 273
University of Sindh (PK), Shenzhen Institute of Building Research (China) (CN), Sukkur IBA University (PK), University of Vaasa (FI), VTT Technical Research Centre of Finland (FI)
Teknologian Tutkimuskeskus VTT
Openalex Percentile: Top 4%
UAV Applications and Optimization
4.99
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.