On the Delay of Reactive-Greedy-Reactive Routing in Unmanned Aeronautical Ad-hoc Networks

Reactive-Greedy-Reactive (RGR) has been proposed as a promising routing protocol in highly mobile density-variable Unmanned Aeronautical Ad-hoc Networks (UAANETs). In RGR, location information of Unmanned Aerial Vehicles (UAVs) as well as reactive end-to-end paths are employed in the routing process. It had already been shown that RGR outperforms existing routing protocols in terms of packet delivery ratio. In this paper, the delay performance of RGR is evaluated and compared against Ad-hoc On-demand Distance Vector (AODV) and Greedy Geographic Forwarding (GGF).We considerextensive simulation scenariostocover both searchingand tracking applicationsofUAANETs. The results illustrate that when the number of UAVs is high enough in a searching mission to form a connected UAANET, RGR performs well. In sparsely connected searching scenarios or dense tracking scenarios, RGR may also slightly decrease delay compared to traditional reactive routing protocols for similar PDR