Approximating sensor network queries using in-network summaries

In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs and maintains a spanning tree within the network, rooted at the basestation. The tree maintains compressed summary information for each link that is used to “stub out” traversal during query processing. Our work is based on a formal model of the in-network tree construction task framed as an optimization problem. We demonstrate hardness results for that problem, and develop efficient approximation algorithms for subtasks that are too expensive to compute exactly. We also propose efficient heuristics to accommodate a wider set of workloads, and empirically evaluate their performance and sensitivity to model changes. Categories and Subject Descriptors: G2.2 [Discrete Mathematics]: Graph Theory-trees; F2.0 [Analysis of Algorithms and Problem Complexity]: General; E1 [Data Structures]distributed data structu...

• Type: Conference
• Year: 2009
• Where: IPSN
• Authors: Alexandra Meliou, Carlos Guestrin, Joseph M. Hellerstein
• Keywords: Efficient Approximate Query, In-network Tree Construction, IPSN 2009, Query Processing, Sensor Networks