Quadratic estimation of success probability of greedy geographic forwarding in unmanned aeronautical ad-hoc networks
Due to the availability of location information in unmanned aerial vehicles (UAVs), we propose to use geographic routing mechanisms as a core forwarding protocol in unmanned aeronautical ad-hoc networks (UAANETs) for the purpose of reducing routing overhead. As a result, this paper investigates the performance of the core forwarding mechanism i.e. the greedy geographic part. Since the forwarding mechanism for dynamic UAANETs with many statistical inter-dependencies is complex, a closed-form model does not exist. Therefore, a quadratic polynomial estimation is proposed for computing the success probability of greedy geographic forwarding based on the results of a set of realistic Monte Carlo simulations. This mathematical model can later be used to predict and evaluate the performance of other greedy-based geographic routing protocols for UAV applications.
|Keywords||Geographic routing, greedy forwarding, Mobile Ad-hoc Network (MANET), quadratic modeling, sourcedestination (SD) communication, Unmanned Aerial Vehicle (UAV), Unmanned Aeronautical Ad-hoc Network (UAANET)|
|Conference||IEEE 75th Vehicular Technology Conference, VTC Spring 2012|
Shirani, R. (Rostam), St-Hilaire, M, Kunz, T, Zhou, Y. (Yifeng), Li, J. (Jun), & Lamont, L. (Louise). (2012). Quadratic estimation of success probability of greedy geographic forwarding in unmanned aeronautical ad-hoc networks. Presented at the IEEE 75th Vehicular Technology Conference, VTC Spring 2012. doi:10.1109/VETECS.2012.6240024