A Comparison of Stateless Position-based Packet Routing Algorithms for FANETs

Scalable routing for wireless communication systems is a compelling and challenging task. To this aim, routing algorithms exploiting geographic information have been proposed. These algorithms refer to nodes by their location, rather than their address, and use those coordinates to route greedily towards a destination. With the advent of unmanned airborne vehicle (UAV) technology, a lot of research effort has been devoted to extend position-based packet routing proposals to three dimensional environments. In this context, Flying Ad-hoc Networks (FANETs), comprised of autonomous flying vehicles, pose several issues. This work focuses on the state-of-the-art, stateless geographic packet routing protocols conceived or adapted for three-dimensional network scenarios. Proposals are evaluated over a common scenario through a comprehensive comparative analysis.