In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. However, in reality, mobile nodes spread in (3D) space. In this paper the authors present four new 3D geographical-based routing algorithms Cylinder, Greedy-Cylinder, Cluster-Cylinder, and Greedy-cluster-Cylinder. In Cylinder routing, the nodes are locally projected on the inner surface of a cylinder, perimeter routing is executed after that. Greedy-Cylinder starts with Greedy routing algorithm until a local minimum is reached. The algorithm then switches to Cylinder routing. Cluster-Cylinder elects a dominating set for all nodes and then uses this set for projection and routing. The fourth algorithm Greedy-cluster-Cylinder is a combination between Greedy-Cylinder and Cluster-Cylinder. The authors evaluate their new algorithms and compare them with many classical known algorithms. The simulation outcomes show the substantial enhancement in delivery rate over other algorithms.
A generalized greedy routing algorithm for 2-connected graphs