Routing and processing multiple aggregate queries in sensor networks

Authors:
Niki Trigoni;Alexandre Guitton;Antonios Skordylis
Affiliations:
Birkbeck College, University of London, London, United Kingdom;Birkbeck College, University of London, London, United Kingdom;Birkbeck College, University of London, London, United Kingdom
Venue:
Proceedings of the 4th international conference on Embedded networked sensor systems
Year:
2006

Citing 4
Cited 2

Power-aware routing in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Multi-query optimization for sensor networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

EDGES: Efficient data gathering in sensor networks using temporal and spatial correlations

Journal of Systems and Software
Effective processing of continuous group-by aggregate queries in sensor networks

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel approach to processing continuous aggregate queries in sensor networks, which lifts the assumption of tree-based routing. Given a query workload and a special-purpose gateway node where results are expected, the query optimizer exploits query correlations in order to generate an energy-efficient distributed evaluation plan. The proposed algorithms, named STG and STS, identify common query sub-aggregates, and propose common routing structures to share the sub-aggregates at an early stage. Moreover, they avoid routing sub-aggregates of the same query through long-disjoint paths, thus further reducing the communication cost of result propagation. In this poster, we provide examples to illustrate the functionality and the communication savings of STG and STS compared to the existing tree-based approach.