A new storage scheme for approximate location queries in object-tracking sensor networks

Jianliang Xu, Xueyan Tang, Wang Chien Lee

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain degree of imprecision in the location data of tracked objects, this paper studies precision-constrained approximate queries that trade answer precision for energy efficiency. We develop an Energy-conserving Approximate StoragE (EASE) scheme to efficiently answer approximate location queries by keeping errorbounded imprecise location data at some designated storage node. The data impreciseness is captured by a system parameter called the approximation radius. We derive the optimal setting of the approximation radius for our storage scheme based on the mobility pattern, and devise an adaptive algorithm to adjust the setting when the mobility pattern is not available a priori or is dynamically changing. Simulation experiments are conducted to validate our theoretical analysis of the optimal approximation setting. The simulation results show that the proposed EASE scheme reduces the network traffic from a conventional approach by up to 96 percent and, in most cases, prolongs the network lifetime by a factor of 2-5.

Original languageEnglish (US)
Pages (from-to)262-275
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Volume19
Issue number2
DOIs
StatePublished - Feb 1 2008

Fingerprint

Sensor networks
Energy efficiency
Adaptive algorithms
Wireless sensor networks
Sensors
Experiments

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

@article{562f070e3b524272953917e96fed5fc2,
title = "A new storage scheme for approximate location queries in object-tracking sensor networks",
abstract = "Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain degree of imprecision in the location data of tracked objects, this paper studies precision-constrained approximate queries that trade answer precision for energy efficiency. We develop an Energy-conserving Approximate StoragE (EASE) scheme to efficiently answer approximate location queries by keeping errorbounded imprecise location data at some designated storage node. The data impreciseness is captured by a system parameter called the approximation radius. We derive the optimal setting of the approximation radius for our storage scheme based on the mobility pattern, and devise an adaptive algorithm to adjust the setting when the mobility pattern is not available a priori or is dynamically changing. Simulation experiments are conducted to validate our theoretical analysis of the optimal approximation setting. The simulation results show that the proposed EASE scheme reduces the network traffic from a conventional approach by up to 96 percent and, in most cases, prolongs the network lifetime by a factor of 2-5.",
author = "Jianliang Xu and Xueyan Tang and Lee, {Wang Chien}",
year = "2008",
month = "2",
day = "1",
doi = "10.1109/TPDS.2007.70740",
language = "English (US)",
volume = "19",
pages = "262--275",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "2",

}

A new storage scheme for approximate location queries in object-tracking sensor networks. / Xu, Jianliang; Tang, Xueyan; Lee, Wang Chien.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 19, No. 2, 01.02.2008, p. 262-275.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A new storage scheme for approximate location queries in object-tracking sensor networks

AU - Xu, Jianliang

AU - Tang, Xueyan

AU - Lee, Wang Chien

PY - 2008/2/1

Y1 - 2008/2/1

N2 - Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain degree of imprecision in the location data of tracked objects, this paper studies precision-constrained approximate queries that trade answer precision for energy efficiency. We develop an Energy-conserving Approximate StoragE (EASE) scheme to efficiently answer approximate location queries by keeping errorbounded imprecise location data at some designated storage node. The data impreciseness is captured by a system parameter called the approximation radius. We derive the optimal setting of the approximation radius for our storage scheme based on the mobility pattern, and devise an adaptive algorithm to adjust the setting when the mobility pattern is not available a priori or is dynamically changing. Simulation experiments are conducted to validate our theoretical analysis of the optimal approximation setting. The simulation results show that the proposed EASE scheme reduces the network traffic from a conventional approach by up to 96 percent and, in most cases, prolongs the network lifetime by a factor of 2-5.

AB - Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain degree of imprecision in the location data of tracked objects, this paper studies precision-constrained approximate queries that trade answer precision for energy efficiency. We develop an Energy-conserving Approximate StoragE (EASE) scheme to efficiently answer approximate location queries by keeping errorbounded imprecise location data at some designated storage node. The data impreciseness is captured by a system parameter called the approximation radius. We derive the optimal setting of the approximation radius for our storage scheme based on the mobility pattern, and devise an adaptive algorithm to adjust the setting when the mobility pattern is not available a priori or is dynamically changing. Simulation experiments are conducted to validate our theoretical analysis of the optimal approximation setting. The simulation results show that the proposed EASE scheme reduces the network traffic from a conventional approach by up to 96 percent and, in most cases, prolongs the network lifetime by a factor of 2-5.

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

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

U2 - 10.1109/TPDS.2007.70740

DO - 10.1109/TPDS.2007.70740

M3 - Article

AN - SCOPUS:38349095522

VL - 19

SP - 262

EP - 275

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 2

ER -