T-TRACKING ALGORITHM FOR DATA TRACKING IN WIRELESS SENSOR NETWORKS

In Wireless Sensor Network the sensor nodes are being dispersed spatially, so the target tracking has become a key factor. In the existing system they have used the Face Tracking for tracking the target. They have developed non-overlapping region called Face. In that they have used Brink Detection algorithm for selecting the edges and Optimal Selection algorithm for selecting sensor node in each face. However, if the selected node fails then tracking accuracy will be lost. In this paper we have a new tracking scheme, called t-Tracking is designed to overcome the target tracking problem in WSNs considering multiple objectives: low capturing time, high quality of tracking (QoT). A set of fully distributed tracking algorithms is proposed, which answers the query whether a target remains in a “specific area” (called a “face”). When a target moves from one face to another face all the possible movements will be mentioned. Then query will be sent to all those nodes about their energy and coverage area. Based on the response from those nodes the best nodes will be selected for continuing tracking when the target moves to the next face. The result of this t-Tracking is compared with already existing face tracking..