Compressing moving object trajectory in wireless sensor networks

Yingqi Xu, Wang-chien Lee

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Some object tracking applications can tolerate delays in data collection and processing. Taking advantage of the delay tolerance, we propose an efficient and accurate algorithm for in-network data compression, called delay-tolerant trajectory compression (DTTC). In DTTC, a cluster-based infrastructure is built within the network. Each cluster head compresses an object's movement trajectory detected within its cluster by a compression function. Rather than transmitting all sensor readings to the sink node, the cluster head communicates only the compression parameters, which not only provide the sink node expressive yet traceable models about the object movements, but also significantly reduce the total amount of data communication required for tracking operations. DTTC supports a broad class of movement trajectories using two proposed techniques, DC-compression and SW-compression, and an efficient trajectory segmentation scheme, which are designed for improving the trajectory compression accuracy at less computation cost. Moreover, we analyze the underlying cluster-based infrastructure and mathematically derive the optimum cluster size, aiming at minimizing the total communication cost of the DTTC algorithm. An extensive simulation has been conducted to compare DTTC with competing prediction-based tracking technique, DPR [28]. Simulation results show that DTTC exhibits superior performance in terms of accuracy, communication cost and computation cost and soundly outperforms DPR with all types of movement trajectories.

Original languageEnglish (US)
Pages (from-to)151-174
Number of pages24
JournalInternational Journal of Distributed Sensor Networks
Volume3
Issue number2
DOIs
StatePublished - Apr 1 2007

Fingerprint

Wireless sensor networks
Trajectories
Costs
Communication
Data compression
Sensors
Processing

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Networks and Communications

Cite this

@article{5a2021d1eb934eb9a3b5497d38cd8214,
title = "Compressing moving object trajectory in wireless sensor networks",
abstract = "Some object tracking applications can tolerate delays in data collection and processing. Taking advantage of the delay tolerance, we propose an efficient and accurate algorithm for in-network data compression, called delay-tolerant trajectory compression (DTTC). In DTTC, a cluster-based infrastructure is built within the network. Each cluster head compresses an object's movement trajectory detected within its cluster by a compression function. Rather than transmitting all sensor readings to the sink node, the cluster head communicates only the compression parameters, which not only provide the sink node expressive yet traceable models about the object movements, but also significantly reduce the total amount of data communication required for tracking operations. DTTC supports a broad class of movement trajectories using two proposed techniques, DC-compression and SW-compression, and an efficient trajectory segmentation scheme, which are designed for improving the trajectory compression accuracy at less computation cost. Moreover, we analyze the underlying cluster-based infrastructure and mathematically derive the optimum cluster size, aiming at minimizing the total communication cost of the DTTC algorithm. An extensive simulation has been conducted to compare DTTC with competing prediction-based tracking technique, DPR [28]. Simulation results show that DTTC exhibits superior performance in terms of accuracy, communication cost and computation cost and soundly outperforms DPR with all types of movement trajectories.",
author = "Yingqi Xu and Wang-chien Lee",
year = "2007",
month = "4",
day = "1",
doi = "10.1080/15501320701204756",
language = "English (US)",
volume = "3",
pages = "151--174",
journal = "International Journal of Distributed Sensor Networks",
issn = "1550-1329",
publisher = "Hindawi Publishing Corporation",
number = "2",

}

Compressing moving object trajectory in wireless sensor networks. / Xu, Yingqi; Lee, Wang-chien.

In: International Journal of Distributed Sensor Networks, Vol. 3, No. 2, 01.04.2007, p. 151-174.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Compressing moving object trajectory in wireless sensor networks

AU - Xu, Yingqi

AU - Lee, Wang-chien

PY - 2007/4/1

Y1 - 2007/4/1

N2 - Some object tracking applications can tolerate delays in data collection and processing. Taking advantage of the delay tolerance, we propose an efficient and accurate algorithm for in-network data compression, called delay-tolerant trajectory compression (DTTC). In DTTC, a cluster-based infrastructure is built within the network. Each cluster head compresses an object's movement trajectory detected within its cluster by a compression function. Rather than transmitting all sensor readings to the sink node, the cluster head communicates only the compression parameters, which not only provide the sink node expressive yet traceable models about the object movements, but also significantly reduce the total amount of data communication required for tracking operations. DTTC supports a broad class of movement trajectories using two proposed techniques, DC-compression and SW-compression, and an efficient trajectory segmentation scheme, which are designed for improving the trajectory compression accuracy at less computation cost. Moreover, we analyze the underlying cluster-based infrastructure and mathematically derive the optimum cluster size, aiming at minimizing the total communication cost of the DTTC algorithm. An extensive simulation has been conducted to compare DTTC with competing prediction-based tracking technique, DPR [28]. Simulation results show that DTTC exhibits superior performance in terms of accuracy, communication cost and computation cost and soundly outperforms DPR with all types of movement trajectories.

AB - Some object tracking applications can tolerate delays in data collection and processing. Taking advantage of the delay tolerance, we propose an efficient and accurate algorithm for in-network data compression, called delay-tolerant trajectory compression (DTTC). In DTTC, a cluster-based infrastructure is built within the network. Each cluster head compresses an object's movement trajectory detected within its cluster by a compression function. Rather than transmitting all sensor readings to the sink node, the cluster head communicates only the compression parameters, which not only provide the sink node expressive yet traceable models about the object movements, but also significantly reduce the total amount of data communication required for tracking operations. DTTC supports a broad class of movement trajectories using two proposed techniques, DC-compression and SW-compression, and an efficient trajectory segmentation scheme, which are designed for improving the trajectory compression accuracy at less computation cost. Moreover, we analyze the underlying cluster-based infrastructure and mathematically derive the optimum cluster size, aiming at minimizing the total communication cost of the DTTC algorithm. An extensive simulation has been conducted to compare DTTC with competing prediction-based tracking technique, DPR [28]. Simulation results show that DTTC exhibits superior performance in terms of accuracy, communication cost and computation cost and soundly outperforms DPR with all types of movement trajectories.

UR - http://www.scopus.com/inward/record.url?scp=34248180244&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34248180244&partnerID=8YFLogxK

U2 - 10.1080/15501320701204756

DO - 10.1080/15501320701204756

M3 - Article

VL - 3

SP - 151

EP - 174

JO - International Journal of Distributed Sensor Networks

JF - International Journal of Distributed Sensor Networks

SN - 1550-1329

IS - 2

ER -