Design and Implementation of Energy Aware Algorithm using Greedy Routing for Sensor Networks

Routing in sensor networks is a challenging issue due to inherent constraints such as energy, memory and CPU processing capabilities. 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 research work, different routing algorithms have been studied and the main focus was on geographic routing in sensor networks. A location based protocol EAGR (Energy Aware Greedy Routing) has been presented for sensor networks to extend the lifetime of the network and to get 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 and its energy levels and the location and 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. The sub-destination nodes must be alive and geographically near to the destination node to route the packet by choosing the shortest and reliable path. Simulation has been made by usin