Smart Partial Flooding Routing Algorithms for 3D Ad Hoc Networks

Mobile ad-hoc networks (MANETs) become an essential part of the current wireless communication infrastructure, thus efficient routing protocols takes an important consideration of the current research. In Geographic-Based routing algorithms, nodes use the location information about nodes to take routing choices. Current geographical routing algorithms usually address the routing environment in 2D space. However, in real life, nodes could be located in 3D space. In this paper, we propose two 3D geographical routing algorithms that uses the advantage of the high delivery rate of the flooding algorithms and the low overhead of the progress-based routing algorithms. The first algorithm (Progress-SGFlooding) uses geographical routing to progress as much as possible to the destination, if its not possible, a partial flooding is used over a sub-graph extracted locally. The second algorithm (Progress- SGFlooding-Progress) used geographical routing to progress to the destination, if the progress is not possible, a partial flooding is used over a sub-graph for one step only and then the algorithm goes back to the geographical routing. We evaluate our algorithm and compare it with current routing algorithms. The simulation results show a significant improvement in delivery rate up to 100% compared to 70% and a huge reduction in overall traffic around 60%.