ACM Home Page
Please provide us with feedback. Feedback
Routing and processing multiple aggregate queries in sensor networks
Full text PdfPdf (124 KB)
Source Conference On Embedded Networked Sensor Systems archive
Proceedings of the 4th international conference on Embedded networked sensor systems table of contents
Boulder, Colorado, USA
POSTER SESSION: Posters table of contents
Pages: 391 - 392  
Year of Publication: 2006
ISBN:1-59593-343-3
Authors
Niki Trigoni  Birkbeck College, University of London, London, United Kingdom
Alexandre Guitton  Birkbeck College, University of London, London, United Kingdom
Antonios Skordylis  Birkbeck College, University of London, London, United Kingdom
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
SIGCOMM: ACM Special Interest Group on Data Communication
SIGOPS: ACM Special Interest Group on Operating Systems
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
ACM: Association for Computing Machinery
SIGBED: ACM Special Interest Group on Embedded Systems
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 59,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1182807.1182871
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
N. Trigoni, Y. Yao, A. Demers, J. Gehrke, and R. Rajaraman. Multi-query optimization for sensor networks. In DCOSS, pages 307--321, 2005.
4
 
5
C. Yu, R. Govindan, and D. Estrin. Geographical and energy aware routing: a recursive data dissemination protocol for wireless sensor networks. TR UCLA/CSD-TR-01-0023, Univ. of Southern California, 2001.

Collaborative Colleagues:
Niki Trigoni: colleagues
Alexandre Guitton: colleagues
Antonios Skordylis: colleagues