Authors: Chih-Yu Lin, Yu-Chee Tseng, Wen-Chih Peng, Ten H. Lai, Hua-Wei Fang
Addresses: Department of Computer Science, National Chiao-Tung University, Hsin-Chu 300, Taiwan. ' Department of Computer Science, National Chiao-Tung University, Hsin-Chu 300, Taiwan. ' Department of Computer Science, National Chiao-Tung University, Hsin-Chu 300, Taiwan. ' Department of Computer Science and Engineering, The Ohio State University, Columbus, OH 43210, USA. ' Networks and Multimedia Institute, Institute for Information Industry, Taipei, Taiwan
Abstract: A wireless sensor network (WSN) 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 multisink sensor network where users can inquire the locations of objects via any sink in the network. The proposed location management scheme consists of two parts. Firstly, a message-efficient algorithm that describes how to perform location updates and queries is proposed. Secondly, 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.
Keywords: object tracking; in-network processing; wireless sensor networks; WSNs; data aggregation; location management; wireless networks; message efficiency; simulation.
International Journal of Sensor Networks, 2008 Vol.3 No.1, pp.3 - 15
Available online: 30 Dec 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article