An in-network querying framework for wireless sensor networks

Murat Demirbas, Xuming Lu, Puneet Singla

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

In contrast to traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, the new generation of information processing applications such as pursuit-evasion games, tracking, evacuation, and disaster relief applications require in-network information storage and querying. Due to the resource limitations of WSNs, it is challenging to implement in-network querying in a distributed, lightweight, resilient, and energy-efficient manner. We address these challenges by exploiting location information and the geometry of the network and propose an in-network querying framework, namely, the Distributed Quad-Tree (DQT). DQT is distance sensitive for querying of an event: the cost of answering a query for an event is at most a constant factor (2√2 in our case) of the distance "d" to the event. DQT construction is local and does not require any communication. Moreover, due to its minimalist infrastructure and stateless nature, DQT shows graceful resilience to node failures and topology changes. Since event-based querying is inherently limited to the anticipated types of inquiries, we further extend our framework to achieve complex range-based querying. To this end, we use a multiresolution algorithm, which is optimal with respect to least square errors that models the data in a decentralized way. Our model-based scheme answers queries with approximate values accompanied by certainty levels with increased resolution at lower layers of the DQT hierarchy. Our analysis and experiments show that our framework achieves distance sensitivity and resiliency for event-based querying, as well as greatly reduces the cost of complex range querying.

Original languageEnglish (US)
Pages (from-to)1202-1215
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Volume20
Issue number8
DOIs
StatePublished - Jun 9 2009

Fingerprint

Wireless sensor networks
Disasters
Costs
Agglomeration
Topology
Data storage equipment
Geometry
Communication
Experiments

All Science Journal Classification (ASJC) codes

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

Cite this

@article{85aa878f25b5422b99887e1761ed659b,
title = "An in-network querying framework for wireless sensor networks",
abstract = "In contrast to traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, the new generation of information processing applications such as pursuit-evasion games, tracking, evacuation, and disaster relief applications require in-network information storage and querying. Due to the resource limitations of WSNs, it is challenging to implement in-network querying in a distributed, lightweight, resilient, and energy-efficient manner. We address these challenges by exploiting location information and the geometry of the network and propose an in-network querying framework, namely, the Distributed Quad-Tree (DQT). DQT is distance sensitive for querying of an event: the cost of answering a query for an event is at most a constant factor (2√2 in our case) of the distance {"}d{"} to the event. DQT construction is local and does not require any communication. Moreover, due to its minimalist infrastructure and stateless nature, DQT shows graceful resilience to node failures and topology changes. Since event-based querying is inherently limited to the anticipated types of inquiries, we further extend our framework to achieve complex range-based querying. To this end, we use a multiresolution algorithm, which is optimal with respect to least square errors that models the data in a decentralized way. Our model-based scheme answers queries with approximate values accompanied by certainty levels with increased resolution at lower layers of the DQT hierarchy. Our analysis and experiments show that our framework achieves distance sensitivity and resiliency for event-based querying, as well as greatly reduces the cost of complex range querying.",
author = "Murat Demirbas and Xuming Lu and Puneet Singla",
year = "2009",
month = "6",
day = "9",
doi = "10.1109/TPDS.2008.217",
language = "English (US)",
volume = "20",
pages = "1202--1215",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "8",

}

An in-network querying framework for wireless sensor networks. / Demirbas, Murat; Lu, Xuming; Singla, Puneet.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 20, No. 8, 09.06.2009, p. 1202-1215.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An in-network querying framework for wireless sensor networks

AU - Demirbas, Murat

AU - Lu, Xuming

AU - Singla, Puneet

PY - 2009/6/9

Y1 - 2009/6/9

N2 - In contrast to traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, the new generation of information processing applications such as pursuit-evasion games, tracking, evacuation, and disaster relief applications require in-network information storage and querying. Due to the resource limitations of WSNs, it is challenging to implement in-network querying in a distributed, lightweight, resilient, and energy-efficient manner. We address these challenges by exploiting location information and the geometry of the network and propose an in-network querying framework, namely, the Distributed Quad-Tree (DQT). DQT is distance sensitive for querying of an event: the cost of answering a query for an event is at most a constant factor (2√2 in our case) of the distance "d" to the event. DQT construction is local and does not require any communication. Moreover, due to its minimalist infrastructure and stateless nature, DQT shows graceful resilience to node failures and topology changes. Since event-based querying is inherently limited to the anticipated types of inquiries, we further extend our framework to achieve complex range-based querying. To this end, we use a multiresolution algorithm, which is optimal with respect to least square errors that models the data in a decentralized way. Our model-based scheme answers queries with approximate values accompanied by certainty levels with increased resolution at lower layers of the DQT hierarchy. Our analysis and experiments show that our framework achieves distance sensitivity and resiliency for event-based querying, as well as greatly reduces the cost of complex range querying.

AB - In contrast to traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, the new generation of information processing applications such as pursuit-evasion games, tracking, evacuation, and disaster relief applications require in-network information storage and querying. Due to the resource limitations of WSNs, it is challenging to implement in-network querying in a distributed, lightweight, resilient, and energy-efficient manner. We address these challenges by exploiting location information and the geometry of the network and propose an in-network querying framework, namely, the Distributed Quad-Tree (DQT). DQT is distance sensitive for querying of an event: the cost of answering a query for an event is at most a constant factor (2√2 in our case) of the distance "d" to the event. DQT construction is local and does not require any communication. Moreover, due to its minimalist infrastructure and stateless nature, DQT shows graceful resilience to node failures and topology changes. Since event-based querying is inherently limited to the anticipated types of inquiries, we further extend our framework to achieve complex range-based querying. To this end, we use a multiresolution algorithm, which is optimal with respect to least square errors that models the data in a decentralized way. Our model-based scheme answers queries with approximate values accompanied by certainty levels with increased resolution at lower layers of the DQT hierarchy. Our analysis and experiments show that our framework achieves distance sensitivity and resiliency for event-based querying, as well as greatly reduces the cost of complex range querying.

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

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

U2 - 10.1109/TPDS.2008.217

DO - 10.1109/TPDS.2008.217

M3 - Article

AN - SCOPUS:67650681797

VL - 20

SP - 1202

EP - 1215

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 8

ER -