By Topic

Approximating sensor network queries using in-network summaries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Meliou, A. ; EECS Dept., UC Berkeley, Berkeley, CA, USA ; Guestrin, C. ; Hellerstein, J.M.

In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensor nets. We use a model-based approach that constructs and maintains a spanning tree within the network, rooted at the base station. The tree maintains compressed summary information for each link that is used to ldquostub outrdquo 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.

Published in:

Information Processing in Sensor Networks, 2009. IPSN 2009. International Conference on

Date of Conference:

13-16 April 2009