EAGR: Energy Aware Greedy Routing scheme for wireless ad hoc networks

This paper presents energy aware greedy routing (EAGR) scheme for wireless ad hoc networks. In this scheme, the cost metric of a node depends on the following parameters of a neighboring node: (1) Distance from the destination, (2) fraction of energy consumed, and (3) rate of energy consumption. When a node has the least cost metric, the packet is forwarded to that node. We evaluate the performance of EAGR in static wireless ad hoc networks by replacing the greedy routing of greedy perimeter stateless routing (GPSR) protocol with EAGR. Evaluation and comparison of GPSR with EAGR and GPSR (with greedy routing) is done through NS simulation. Results show that GPSR with EAGR outperforms the existing GPSR (with greedy routing) with respect to packet delivery fraction, throughput and energy consumption.