Abstract
paper examine that the geographic routing protocols are used in the mobile ad hoc networks. In routing protocols defines that each node identify the position of one hop neighbours, and also the packets are forwarded to a neighbours that is closer to the destination. This forwarding strategy should prevent radio communications between node. However, inexpensive position devices do not provide accuracy for these algorithms and it is difficult to obtain the information on moving nodes. If the nodes should know the shape and position. It have better routing decisions so the packets that are avoided. We proposes that the grid positioning represents by grid ends that are convenient to use and also affected by a small movements of nodes. This paper presents geographic shortest path routing that are used to find out the shortest path at a particular node and also the grid partitioning of a network. The grid cells also contains the density of the nodes. When the node density increases,if the grid cells are stable.This paper also presents simulation results that evaluate the grid-based routing and compares it with position-based routing.
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.
