Message-efficient in-network location management in a multi-sink wireless sensor network

A wireless sensor network consists of many tiny sensor nodes. The distributed memory spaces of sensors can be considered as a large distributed database, in which one can conduct in-network data processing. This paper considers a sensor network used for object tracking where distributed location updates and queries are performed inside the network. Although this issue has been intensively studied for cellular networks, the same problem in sensor networks has very different characteristics. In this paper, we propose an efficient location management scheme for object tracking in a multi-sink sensor network where users can inquire the locations of objects via any sink in the network. A message-efficient algorithm that describes how to perform location updates and queries is proposed. Furthermore, two distributed virtual tree construction algorithms are also presented. The goal is to reduce the overall update and query cost. The efficiency of the proposed algorithms is evaluated and verified by simulations

[1]  Yu-Chee Tseng,et al.  Structures for in-network moving object tracking in wireless sensor networks , 2004, First International Conference on Broadband Networks.

[2]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[4]  Wang-Chien Lee,et al.  On localized prediction for power efficient object tracking in sensor networks , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

[5]  H. T. Kung,et al.  Efficient location tracking using sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[6]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[7]  Jenna Burrell,et al.  Vineyard computing: sensor networks in agricultural production , 2004, IEEE Pervasive Computing.

[8]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

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

[10]  Nathan Ickes,et al.  Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks , 2001, MobiCom '01.

[11]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[12]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

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

[14]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[15]  Gul Agha,et al.  Cooperative tracking with binary-detection sensor networks. , 2003 .

[16]  Lui Sha,et al.  Dynamic clustering for acoustic target tracking in wireless sensor networks , 2003, IEEE Transactions on Mobile Computing.

[17]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.