Tree-based object tracking without mobility statistics in wireless sensor networks

Authors:
Li-Hsing Yen;Bang Ye Wu;Chia-Cheng Yang
Affiliations:
Department Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan, ROC 811;Department Computer Science and Information Engineering, National Chung Cheng University, Chiayi County, Taiwan, ROC 621;Department Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan, ROC 300
Venue:
Wireless Networks
Year:
2010

Citing 10
Cited 1

Smooth is better than sharp: a random mobility model for simulation of wireless networks

MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem

AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Deterministic Polylog Approximation for Minimum Communication Spanning Trees

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Localized Prediction for Power Efficient Object Tracking in Sensor Networks

ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Predictive distance-based mobility management for multidimensional PCS networks

IEEE/ACM Transactions on Networking (TON)
Efficient In-Network Moving Object Tracking in Wireless Sensor Networks

IEEE Transactions on Mobile Computing
Wireless sensor network localization techniques

Computer Networks: The International Journal of Computer and Telecommunications Networking
Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure

IEEE Transactions on Computers
DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks

IEEE Transactions on Wireless Communications

An adaptive cone based distributed tracking algorithm for a highly dynamic target in wireless sensor networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Object tracking in wireless sensor networks is to track mobile objects by scattered sensors. These sensors are typically organized into a tree to deliver report messages upon detecting object's move. Existing tree construction algorithms all require a mobility profile that characterizes the movement statistics of the target object. Mobility profiles are generally obtained based on historical running traces. The contribution of this work is twofold. We first show that the problem of finding an optimal message report tree that requires the least amount of report messages is NP-hard. We then propose analytic estimates of mobility profiles based on Markov-chain model. This profiling replaces an otherwise experimental process that generates and analyzes running traces. Simulation results show that the analytic profiling works well and can replace costly statistical profiling without noticeable performance degradation.