Skip to Main content Skip to Navigation
Conference papers

An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks

Abstract : In this paper, we study algebraic aggregate com- putations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the average function under a harsh model of the conditions under which sensor nodes operate. This protocol is shown to be time-optimal in presence of unfrequent failures. The approach followed saves time and energy by relying the computation on a small network of delegate nodes that can be rebuilt fast in case of node failures and communicate using a collision- free schedule. Delegate nodes run simultaneously two protocols, namely, a collection/dissemination tree-based algorithm, which is shown to be optimal, and a mass-distribution algorithm. Both algorithms are analyzed under a model where the frequency of failures is a parameter. Other aggregate computation algo- rithms can be easily derived from this protocol. To the best of our knowledge, this is the first optimal early-stopping algorithm for aggregate computations in Sensor Networks.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00432380
Contributor : Chrsitopher Thraves Caro <>
Submitted on : Monday, November 16, 2009 - 12:47:22 PM
Last modification on : Tuesday, June 15, 2021 - 4:26:45 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 2:10:15 PM

File

PRDC09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00432380, version 1

Citation

Antonio Fernández Anta, Miguel Mosteiro, Christopher Thraves-Caro. An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks. Pacific Rim International Symposium on Dependable Computing, Nov 2009, Shanghai, China. ⟨inria-00432380⟩

Share

Metrics

Record views

419

Files downloads

411