DeepAI AI Chat
Log In Sign Up

On Greedy Routing in Dynamic UAV Networks

by   Mehrdad Khaledi, et al.
Northern Arizona University

Unmanned aerial vehicles (UAVs), commonly known as drones, are becoming increasingly popular for various applications. Freely flying drones create highly dynamic environments, where conventional routing algorithms which rely on stationary network contact graphs fail to perform efficiently. Also, link establishment through exploring optimal paths using hello messages (as is used in AODV algorithm) deems extremely inefficient and costly for rapidly changing network topologies. In this paper, we present a distance-based greedy routing algorithm for UAV networks solely based on UAVs' local observations of their surrounding subnetwork. Thereby, neither a central decision maker nor a time-consuming route setup and maintenance mechanism are required. To evaluate the proposed method, we derive an analytical bound for the expected number of hops that a packet traverses. Also, we find the expected end-to-end distance traveled by each packet as well as the probability of successful delivery. The simulation results verify the accuracy of the developed analytical expressions and show considerable improvement compared to centralized shortest path routing algorithms.


page 1

page 2

page 3

page 4


Connectivity and Collision Constrained Opportunistic Routing for Emergency Communication using UAV

Emergency communication is extremely important to aid rescue and search ...

On-Demand Routing for Urban VANETs using Cooperating UAVs

Vehicular ad hoc networks (VANETs) are characterized by frequent routing...

OPAR: Optimized Predictive and Adaptive Routing for Cooperative UAV Networks

Cooperative UAV networks are becoming increasingly popular in military a...

An agent-based self-protective method to secure communication between UAVs in unmanned aerial vehicle networks

UAVNs (unmanned aerial vehicle networks) may become vulnerable to threat...

Fully-echoed Q-routing with Simulated Annealing Inference for Flying Adhoc Networks

Current networking protocols deem inefficient in accommodating the two k...

Decentralized Multi-UAV Routing in the Presence of Disturbances

We introduce a decentralized and online path planning technique for a ne...

Hierarchical Deep Double Q-Routing

This paper explores a deep reinforcement learning approach applied to th...