Mobility Profiling Using Markov Chains for Tree-Based Object Tracking in Wireless Sensor Networks

Authors:
Li-Hsing Yen;Chia-Cheng Yang
Affiliations:
Chung Hua University;Chung Hua University
Venue:
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops - Volume 02
Year:
2006

Citing 0
Cited 3

An efficient location tracking structure for wireless sensor networks

Computer Communications
Dynamic object tracking tree in wireless sensor network

EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Survey of mobile object tracking protocols in wireless sensor networks: a network-centric perspective

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Object tracking in wireless sensor networks is to track moving 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 is obtained based on historical statistics. In this paper, we propose an analytic estimate of such mobility profile based on Markov-chain model. This estimate replaces otherwise experimental process that collects statistical data. Simulation results confirm the effectiveness of the proposed approach.