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.