A-Star Algorithm for Energy Efficient Routing in Wireless Sensor Network

Various routing protocols have been designed and developed for Wireless Sensor Networks (WSN). They face various challenges. Sensor nodes are strongly energy and storage constrained and failure rate of sensor node is very high. While sending data to the Base station some routine mechanisms which consider all these parameters, are needed to extend life of the network. There are several techniques for routing in WSN for data gathering with aggregation and for data gathering without aggregation. Using Minimum transmission energy model and Minimum hop routing model techniques it may happen that the same path is used for more times and nodes on this route gets drain from energy. This leads to network partition and routing algorithm failure. In this paper, we have presented routing algorithm based on informed search. We have used A-Star algorithm to search optimal route from source to the destination in such a way that overall life of network is extended. We have used a pre-defined minimum energy level (Level1) for sensor nodes so that sensor node don't participate in routine if its residual energy level is below this level and other better path is available. If there exist no such path, then this node can be part of routing.