Abstract
wireless multi-hop networks (AHWMNs) are communication networks that consist of wireless nodes, placed together in an ad hoc manner, i.e. with minimal prior planning. All nodes in the network have routing capabilities and forward data packets for other nodes in multi-hop fashion. AHWMNs pose substantially different challenges to routing protocols than more traditional wired networks. AHWMN routing protocols are classified as topology-based, position- based. Topology-based routing protocols use the information about the links that exist in the network to perform packet forwarding. Position based routing is a routing principle that relies on geographic information. Position-based routing algorithms require information about the physical position of the participating node. Commonly, each node determines its own position through the use of Global Positioning System (GPS). Decisions made based on destination position and position of forwarding nodes neighbours. A location service is used by the sender of packet to determine the position of the destination and to include it in the packet destination address. The Greedy Perimeter Stateless Routing Protocol is a novel routing protocol for wireless datagram networks. Greedy perimeter stateless routing is based on greedy packet forwarding to forward packets to nodes that always progressively closer to the destination in each step using local information. Thus, each node forwards the message to the neighbours that are most suitable from a local point of view. Greedy forwarding can lead into a dead end, way there is no neighbour closer to the destination. The algorithm recovers by routing around the perimeter of the region by keeping state only about the local topology; GPSR scales better in per- router state than shortest path and ad hoc routing protocols as the number of network destination increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. In this paper performance of GPSR with the Ad hoc On demand distance Vector (AODV) routing protocol and Dynamic Source Routing (DSR) protocol is compared.
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.
