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 informat...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 International Conference on Information Processing in Sensor Networks s. 229 - 240
Hlavní autoři: Meliou, Alexandra, Guestrin, Carlos, Hellerstein, Joseph M.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Washington, DC, USA IEEE Computer Society 13.04.2009
IEEE
Edice:ACM Conferences
Témata:
Algorithm design and analysis
Approximation algorithms
Computer systems organization > Architectures > Distributed architectures
Data Compression
Hardware > Communication hardware, interfaces and storage
Information systems > Data management systems > Database management system engines > Database query processing
Information systems > Data management systems > Database management system engines > Parallel and distributed DBMSs
Information systems > Information retrieval > Evaluation of retrieval results
Information systems > Information retrieval > Information retrieval query processing
Mathematics
Mathematics of computing > Mathematical analysis > Functional analysis > Approximation
Networks
Permission
Predictive models
Query Approximation
Query processing
Routing
Sensor Networks
Sensor phenomena and characterization
Temperature sensors
Theory of computation > Design and analysis of algorithms > Approximation algorithms analysis
Theory of computation > Theory and algorithms for application domains > Database theory > Database query processing and optimization (theory)
Wireless sensor networks
ISBN:1424451086, 9781424451081
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1424451086
9781424451081
DOI:10.5555/1602165.1602187