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 consider extensive simulation scenarios to cover both searching and tracking applications of UAANETs. 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.

Additional Metadata
Keywords Ad-hoc On-demand Distance Vector (AODV), Greedy Geographic Forwarding (GGF), Reactive routing, Reactive-Greedy-Reactive (RGR), Unmanned Aerial Vehicle (UAV), Unmanned Aeronautical Ad-hoc Network (UAANET)
Persistent URL dx.doi.org/10.1016/j.procs.2012.06.068
Conference 3rd International Conference on Ambient Systems, Networks and Technologies, ANT 2012 and 9th International Conference on Mobile Web Information Systems, MobiWIS 2012
Citation
Shirani, R. (Rostam), St-Hilaire, M, Kunz, T, Zhou, Y. (Yifeng), Li, J. (Jun), & Lamont, L. (Louise). (2012). On the delay of reactive-greedy-reactive routing in unmanned aeronautical ad-hoc networks. Presented at the 3rd International Conference on Ambient Systems, Networks and Technologies, ANT 2012 and 9th International Conference on Mobile Web Information Systems, MobiWIS 2012. doi:10.1016/j.procs.2012.06.068