Tracking coverage throughout epochs with bounded uncertainty

This work addresses the problem of managing the sensor-coverage and organizing the epochs in a manner that balances the trades-offs between the accuracy and energy consumptions during target tracking in Wireless Sensor Networks (WSN). While the typical target tracking approaches are based on movement prediction, we only assume a knowledge of some maximal speed of the target during certain time-intervals. This, in turn, restricts its whereabouts to a disk-bound area throughout such intervals. In such settings, we seek to determine a sensor cover, a subset of all the nodes that need to be awake, which ensures that the target can be detected during the given epoch. Towards this, we propose sensor-cover selection methodologies, Greedy Uncertain Moving Object coverage sensor set selection (GUMO) and PAttern Based coverage sensor set selection (PAB). GUMO is a heuristic maximizing the coverage gain at each step, while PAB is an approach based on optimal deployment pattern of sensor nodes achieving coverage of the disk area bounding the target's whereabouts. We conduct extensive simulations to evaluate the performance of the algorithms, and the results reveal that GUMO and PAB not only provide substantial energy saving due to reduction in the communications involved in selecting tracking participant-nodes and principal(s), while assuring a bounded error on the target's location.