Energy efficient routing algorithm on the target tracking in Wireless Sensor Network

Wireless Sensor Network (WSN) has many applications in day to day life. One of the applications of WSN is target tracking that uses sensors to track and localize the targets. This makes sensor node deployment in a network necessary and highly important. But the main challenge faced by sensor networks is the power consumption by sensor nodes. Hence an energy optimization technique must be in place that ultimately reduces the actual power consumption of the sensor nodes. Here, the shortest path algorithms are used in routing and it helps in reducing the energy consumption. The shortest path algorithms used in wireless sensor network are Dijkstra's algorithm and Floyd-Warshall's algorithm. They are also used for calculating throughput, packet delivery ratio and energy consumption for given number of nodes. The Floyd-Warshall's algorithm is not scalable and efficient for routing in WSN. Hence, we use modified Floyd-Warshall's algorithm that obtains better throughput, packet delivery ratio and minimized energy consumption. The new Modified Floyd-Warshall's algorithm calculates the shortest path from node to node by adding an acknowledgment mechanism. We have done a comparative analysis of Dijkstra's algorithm, Floyd-Warshall's algorithm, and modified Floyd-Warshall's algorithm for parameters like packet deliver ratio, throughput, and energy optimization for multiple nodes. From simulation results it is observed that the modified Floyd-Warshall's algorithm works better than Dijkstra's and Floyd Warshall's algorithm in terms of Packet Delivery ratio, throughput and energy consumption.