An Energy-aware Greedy Perimeter Stateless Routing Protocol for Mobile Ad hoc Networks

Abstract

highlevel contribution of this paper is an ene rgyaware version of the wellknown positionbased Greedy Per imeter Stateless Routing (GPSR) protocol for mobile ad hoc networks (MANETs). In the proposed energyaware GPSR protocol , referred to as EGPSR, we optimize the greedy forwa rding mode as follows: a forwarding node first determines a candidate set of neighbor nodes - the nodes that lie closer to the destination than itself. The weight of each such candidate neighbor node is then computed to be the sum of the fraction of the initial energy currently available at the neighbor node and the progress (i.e., the fraction of the distance covered between the forwarding node and the destination) obtained with the selection of the neighbor node. The candidate neighbor node that has the largest weight value is the chosen next hop node to receive the data packet. This procedure is repeated at every hop where greedy forwarding is possible. In case, greedy forwarding is not possible, similar to GPSR, EGPSR switches to perimeter forwarding. With EGPSR, the fairness of node usage considerably improves compared to GPSR. Simulation results illustrate that the time of first node failure, due to the exhaustion of battery charge, increases significantly (as large as by 55%) with the use of EGPSR, whereas the hop count increases only as large as by 7%.