A hybrid reactive and position-based approach to packet routing in 3D topology networks
Daniele Ronzani, Armir Bujari, Claudio Enrico Palazzi · 2018
Scalable routing for ad-hoc wireless systems is a compelling and challenging task. In particular, due to mobility of nodes, topological information is volatile and changes in time. In this context, routing algorithms exploiting geographic information have been proposed to address this issue. This class of protocols exploits nodes' location, rather than their address and routing tables, to greedily route data towards a destination. Mainly proposed and tuned in the context of 2D MANETs these protocols exhibit less overhead in terms of control traffic and state, however, they are susceptible to local minina due to their localized decision making. In this context, we propose a hybrid position-topology based algorithm named Greedy Distance Vector (GDV), which tries to strike a balance between a greedy and topology-based forwarding process in a 3D environment. GDV greedily routes data packet toward a destination by exploiting nodes coordinates and whenever a local minima is found shifts to a topology, reactive-based approach to recover the delivery process. We present a preliminary simulation and discuss the benefits of the approach.