Greedy cylinder routing algorithm for mobile network devices

Abstract

In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. But, in reality, mobile nodes spread in (3D) space. In this paper we present two new 3D geographical-based routing algorithms Cylinder and GCylinder. In Cylinder routing, the nodes are locally projected onto the inner surface of a cylinder, face 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. We evaluate our new algorithms and compare them with greedy algorithm. The simulation outcomes show the substantial enhancement in delivery rate over other classical known algorithms.