Structures for in-network moving object tracking in wireless sensor networks

Chih Yu Lin*, Yu-Chee Tseng

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

38 Scopus citations

Abstract

One important application of wireless sensor networks is tracking moving objects. The recent progress has made it possible for tiny sensors to have more computing power and storage space. Therefore, a sensor network can be considered as a distributed database, on which one can conduct in-network data processing. This paper considers in-network moving object tracking in a sensor network. This typically consists of two operations: location update and query. We propose a message-pruning tree structure that is an extension of the earlier work, which assumes the existence of a logical structure to connect sensors in the network. We formulate this problem as an optimization problem. The formulation allows us to take into account the physical structure of the sensor network, thus leading to more efficient solutions than in terms of communication costs. We evaluate updating and querying costs through simulations.

Original languageEnglish
Title of host publicationProceedings - First International Conference on Broadband Networks, BroadNets 2004
Pages718-727
Number of pages10
DOIs
StatePublished - 1 Dec 2004
EventProceedings - First International Conference on Broadband Networks, BroadNets 2004 - San Jose, CA, United States
Duration: 25 Oct 200429 Oct 2004

Publication series

NameProceedings - First International Conference on Broadband Networks, BroadNets 2004

Conference

ConferenceProceedings - First International Conference on Broadband Networks, BroadNets 2004
Country/TerritoryUnited States
CitySan Jose, CA
Period25/10/0429/10/04

Fingerprint

Dive into the research topics of 'Structures for in-network moving object tracking in wireless sensor networks'. Together they form a unique fingerprint.

Cite this