Optimizing multiple in-network aggregate queries in wireless sensor networks

Authors:
Huei-You Yang;Wen-Chih Peng;Chia-Hao Lo
Affiliations:
Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan, ROC
Venue:
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Year:
2007

Citing 6
Cited 1

The cougar approach to in-network query processing in sensor networks

ACM SIGMOD Record
TAG: a Tiny AGgregation service for ad-hoc sensor networks

ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Balancing energy efficiency and quality of aggregate data in sensor networks

The VLDB Journal — The International Journal on Very Large Data Bases
TinyDB: an acquisitional query processing system for sensor networks

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Processing multiple aggregation queries in geo-sensor networks

DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Multi-query optimization for sensor networks

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

Error estimation in wireless sensor networks

Proceedings of the 2008 ACM symposium on Applied computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we explore the feature of sharing partial results of multiple queries to reduce the total number of messages incurred. Those queries sharing their partial results are referred to as backbones. Given a set of queries, we shall determine backbones with the purpose of minimizing the total number of messages. Specifically, given a set of queries, we derive a graph, where each vertex represents one query and the corresponding weight edge denotes the number of messages reduced by sharing partial results. Then, we develop a heuristic algorithm SB (standing for Selecting Backbones) to derive a cut in which both backbones and non-backbones are determined. Simulation results show that by sharing partial results, algorithm SB is able to significantly reduce the total number of messages involved.