Tracking on a graph

This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of sensors and difficulties in sensor network localization. Based on the simplest sensor model, in which each sensor reports only a binary value indicating whether an object is present near the sensor or not, we present an optimal distributed tracking algorithm which does not require sensor network localization. The tracking problem is formulated as a hidden state estimation problem over the finite state space of sensors. Then a distributed tracking algorithm is derived from the Viterbi algorithm. We also describe provably good pruning strategies for scalability of the algorithm and show the conditions under which the algorithm is robust against false detections. The algorithm is also extended to handle non-disjoint sensing regions and to track multiple moving objects. Since the computation and storage of track information are done in a completely distributed manner, the method is robust against node failures and transmission failures. In addition, the use of binary sensors makes the proposed algorithm suitable for many sensor network applications.

[1]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[2]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[3]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[4]  Yu Hen Hu,et al.  Detection, classification, and tracking of targets , 2002, IEEE Signal Process. Mag..

[5]  Gaurav S. Sukhatme,et al.  Connecting the Physical World with Pervasive Networks , 2002, IEEE Pervasive Comput..

[6]  Zack J. Butler,et al.  Tracking a moving object with a binary sensor network , 2003, SenSys '03.

[7]  Leonidas J. Guibas,et al.  A Distributed Algorithm for Managing Multi-target Identities in Wireless Ad-hoc Sensor Networks , 2003, IPSN.

[8]  Feng Zhao,et al.  Distributed Group Management for Track Initiation and Maintenance in Target Localization Applications , 2003, IPSN.

[9]  Hans Mulder,et al.  Smart sensors to network the world. , 2004, Scientific American.

[10]  Mark Coates,et al.  Distributed particle filters for sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[11]  James Aspnes,et al.  On the Computational Complexity of Sensor Network Localization , 2004, ALGOSENSORS.

[12]  Feng Zhao,et al.  Distributed state representation for tracking problems in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[13]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[14]  Mark G. Terwilliger,et al.  Overview of Sensor Networks , 2004 .

[15]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[16]  David E. Culler,et al.  Sensor Field Localization: A Deployment and Empirical Analysis , 2004 .

[17]  Bruno Sinopoli,et al.  A kernel-based learning approach to ad hoc sensor network localization , 2005, TOSN.

[18]  Prasanta K. Bose,et al.  Swarm Coordination for Pursuit Evasion Games using Sensor Networks , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[19]  S. Shankar Sastry,et al.  A Hierarchical Multiple-Target Tracking Algorithm for Sensor Networks , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.