Message-efficient in-network location management in a multisink wireless sensor network
by Chih-Yu Lin, Yu-Chee Tseng, Wen-Chih Peng, Ten H. Lai, Hua-Wei Fang
International Journal of Sensor Networks (IJSNET), Vol. 3, No. 1, 2008

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.

Online publication date: Sun, 30-Dec-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email