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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
