Low overhead hybrid geographic-based routing algorithms with smart partial flooding for 3D ad hoc networks

Abstract

One known design for routing algorithms in mobile ad hoc networks is to use flooding. But, these algorithms are usually suffer from high overhead. Another common design is to use the nodes geographic locations 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. To benefit from the advantages of both techniques we propose several 3D new routing algorithms that maximize the packets delivery rate and minimize the overhead. Our first set of algorithms (SPF: smart partial flooding) uses the nodes location to do the flooding in the direction of the destination over a sub-graph of the original dense graph. The second set (Progress–SPF) uses geographical routing to progress as much as possible to the destination, if its not possible, SPF is used over a sub-graph extracted locally. The 3rd set (Progress–SPF–Progress) used geographical routing to progress to the destination, if the progress is not possible, SPF is used over a sub-graph for one step only and then the algorithm goes back to the geographical routing. We evaluate our algorithms and compare them 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\%\).