TPSS: A two-phase sleep scheduling protocol for object tracking in sensor networks

Lifetime maximization is an important factor in the design of sensor networks for object tracking applications. Some techniques of node scheduling have been proposed to reduce energy consumption. By exploiting the redundancy of network coverage, they turn off unnecessary nodes, or make nodes work in turn, which require high nodes density or sacrificing tracking quality. We present TPSS, a two-phase sleep scheduling protocol, which divides the whole tracking procedure into two phases and assigns different scheduling policies at each phase. To balance energy savings and tracking quality, we further optimize the node scheduling protocol in terms of network coverage and nodes state prediction. We evaluate our method in an indoor environment with 36 sensor nodes. Comparing with the existing methods, all the experimental results show that our method has a high performance in term of energy savings and tracking quality.

[1]  Teofilo F. Gonzalez,et al.  Covering a Set of Points in Multidimensional Space , 1991, Inf. Process. Lett..

[2]  Gang Zhou,et al.  Achieving Long-Term Surveillance in VigilNet , 2006, INFOCOM.

[3]  Gang Zhou,et al.  Achieving Real-Time Target Tracking UsingWireless Sensor Networks , 2006, 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06).

[4]  Akbar M. Sayeed,et al.  Detection, Classification and Tracking of Targets in Distributed Sensor Networks , 2002 .

[5]  Tarek F. Abdelzaher,et al.  Towards optimal sleep scheduling in sensor networks for rare-event detection , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

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

[7]  D. McErlean,et al.  Distributed detection and tracking in sensor networks , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[8]  J. Singh,et al.  Tracking Multiple Targets Using Binary Proximity Sensors , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[9]  Guohong Cao,et al.  DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks , 2004, IEEE Transactions on Wireless Communications.

[10]  Jaehoon Jeong,et al.  MCTA: Target Tracking Algorithm Based on Minimal Contour in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[11]  Eytan Modiano,et al.  Construction and Maintenance of Wireless Mobile Backbone Networks , 2009, IEEE/ACM Transactions on Networking.

[12]  Bodhi Priyantha,et al.  The Cricket indoor location system , 2005 .

[13]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[14]  Nisheeth Shrivastava,et al.  Target tracking with binary proximity sensors , 2009, TOSN.

[15]  David E. Culler,et al.  Design of a wireless sensor network platform for detecting rare, random, and ephemeral events , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[16]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..

[17]  Eytan Modiano,et al.  Mobile backbone networks --: construction and maintenance , 2006, MobiHoc '06.

[18]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[19]  S. Shankar Sastry,et al.  Tracking on a graph , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[20]  Akbar M. Sayeed,et al.  Collaborative Signal Processing for Distributed Classification in Sensor Networks , 2003, IPSN.

[21]  Xiuzhen Cheng,et al.  Fault tolerant target tracking in sensor networks , 2009, MobiHoc '09.