Hierarchical In-Network Data Aggregation with Quality Guarantees

Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor networks. The key idea is to build an aggregation tree, in which parent nodes aggregate the values received from their children. Nevertheless, for large sensor networks with severe energy constraints the reduction obtained through the aggregation tree might not be sufficient. In this paper we extend prior work on in-network data aggregation to support approximate evaluation of queries to further reduce the number of exchanged messages among the nodes and extend the longevity of the network. A key ingredient to our framework is the notion of the residual mode of operation that is used to eliminate messages from sibling nodes when their cumulative change is small. We introduce a new algorithm, based on potential gains, which adaptively redistributes the error thresholds to those nodes that benefit the most and tries...

• Type: Conference
• Year: 2004
• Where: EDBT
• Authors: Antonios Deligiannakis, Yannis Kotidis, Nick Roussopoulos
• Keywords: Aggregation Tree, Database, EDBT 2004, In-network Data Aggregation, Large Sensor Networks