EAGR: Energy Aware Greedy Routing in Sensor Networks

The energy efficiency is one of the key concerns in sensor networks for their better performance, as sensor nodes are limited in their battery power. In this paper, a location based algorithm, EAGR (Energy Aware Greedy Routing), is presented for sensor networks to extend the lifetime of the network and to get the higher data delivery rate and to balance the energy consumption of nodes. In EAGR, each node makes the local decision to choose its next hop. This algorithm works on forwarding rule based on location and energy levels of nodes. Each node knows its own geographic location & its energy levels and the location & energy level of its neighbors. The transmitting node writes the geographic position of destination into the packet header and forwards it to the destination by establishing the sub-destinations. Now these sub- destination nodes should be alive and geographically near to the destination node to route the packet by choosing the shortest and reliable path. Simulation results show that the proposed algorithm gives the better performance in terms of higher data delivery rate and less number of dead nodes. Consequently, EAGR can effectively increase the lifetime of the network. Key Words: Sensor Networks, Energy-efficient, Geographical Routing Algorithm,