Flying Ad-Hoc Networks are ad-hoc networks composed of flying objects (e.g., drones). In this context, we have 3D topologies in which it is interesting to study routing algorithms exploiting geographic information. These algorithms refer to nodes by their location, not address, and use those coordinates to route greedily, when possible, towards a destination. We are focused on the state-of-the-art, stateless geographic packet routing protocols conceived or adapted for three-dimensional network scenarios. Each protocol is based on a specific forwarding algorithm, which tries to send a packet to a neighbor node according to the rule specified by the algorithm. Compared Routing Algorithms We have implemented in NS-2 the following routing algorithms and performed a comparison over a common simulation scenario. Greedy is a simple progress-based forwarding strategy. A node forwards the packet to the neighbor node that minimizes the distance to the destination node. In general, if ...
When you’re curious, you find lots of interesting things to do.