Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams

Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique strengths and weaknesses. In this paper, we introduce Tributary-Delta, a novel approach that combines the advantages of the tree and multi-path approaches by running them simultaneously in different regions of the network. We present schemes for adjusting the regions in response to changes in network conditions, and show how many useful aggregates can be readily computed within this new framework. We then show how a difficult aggregate for this context-finding frequent items--can be efficiently computed within the framework. To this end, we devise the first algorithm for frequent items (and for quantiles) that provably minimizes the worst case total communication for non-regular trees. In addition, we give a multi-path algorithm for frequent items that is considerably more accurate than previous approaches. Th...

• Type: Conference
• Year: 2005
• Where: SIGMOD
• Authors: Amit Manjhi, Suman Nath, Phillip B. Gibbons
• Keywords: Database, Frequent Items, Multi-path Algorithm, SIGMOD 2005, Tributary-Delta Frequent Items