Hybrid Position-Based 3D Routing Algorithms with Partial Flooding

Position-based routing algorithms use the location information to reduce routing overhead in mobile ad-hoc networks. In this paper we propose two position-based routing algorithms which combine progress-based routing with restricted directional flooding-based routing algorithms for routing in 3 dimensional environments (3D). The first algorithm 3D_ABLAR(m) chooses m neighbors according to a space-partition heuristic and forwards the message to all these nodes. The second algorithm (C, G)-3D_ABLAR(m)-(C, G) uses progress-based routing until a local minimum is reached. The algorithm then switches to the first algorithm for one step and then progress-based routing is resumed. We evaluate our algorithm and compare it with current routing algorithms. The simulation results show a significant improvement in delivery rate (99% compared to 63%) and reduction in traffic (up to 50%)