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
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
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
Tributaries and deltas: efficient and robust aggregation in sensor network streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Network correlated data gathering with explicit communication: NP-completeness and algorithms
IEEE/ACM Transactions on Networking (TON)
Synopsis diffusion for robust aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
REQUEST: region-based query processing in sensor networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
| Hi-index | 0.00 |
In wireless sensor networks, in-network processing of aggregation queries has been an important technique to reduce energy consumption in wireless communication, which is a main source of energy consumption in sensor devices. In-network processing is typically guided by an aggregation tree, where each node forwards partially computed aggregates to its parent. In this paper we consider a routing method for grouped aggregation queries, where sensor readings are divided into disjoint groups according to their values and aggregates are computed for each group. For this type of queries, multipath routing, where each node forwards different aggregates to different nodes, can lead to more efficient in-network processing. However, no multipath routing protocol for efficient in-network processing of grouped aggregation queries has been proposed thus far. In this paper we propose a new routing protocol, called Content-based Multipath Routing (CMR), for efficient in-network processing of grouped aggregation queries. CMR employs multipath routing, and each node forwards partially computed aggregates along different paths based on the contents of the aggregates. The experimental results show that CMR outperforms the existing aggregation tree-based routing protocols.