Performance Evaluation of Greedy Perimeter Stateless Routing Protocol in Ad Hoc Networks

Several geographic routing protocols using location information have already been proposed for ad hoc networks in order to improve performance of ad hoc routing protocols. Here we can mention the case of greedy perimeter stateless routing (GPSR) protocol. GPSR makes greedy forwarding decisions using merely information about a router´s immediate neighbors in the network topology. In case a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. This paper presents the performance evaluation of GPSR protocol for its qualities of scaling and its good performance even at high mobility. We simulated the protocol by using the hierarchical location service (HLS) which is purely geographical in its strategy for selecting and updating the location servers. The performance evaluation is based mainly on three network metrics: packet delivery ratio (PDR), traffic overhead (TOH) and end to end delay (EED). We have focused on the variation effects of a network parameters set such as: the number of mobile nodes, the network load, speed nodes and inter-beacon interval.