An early-stopping protocol for computing aggregate functions in Sensor Networks

DOI10.1016/J.JPDC.2012.09.013MaRDI QIDQ362558zbMATH OpenOpenAlexFDO

Authors Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves

Publication date 22 August 2013

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00432380/file/PRDC09.pdf, http://www.sciencedirect.com/science/article/pii/S0743731512002286

zbMATH Keywords

sensor networksaggregate computationaverage computingearly-stopping algorithmfailure model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• A note on efficient aggregate queries in sensor networks
• A note on efficient aggregate queries in sensor networks
• Mathematical Foundations of Computer Science 2003
• Linear approaches to resilient aggregation in sensor networks
• Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions

Cited in

(2)

• A faster exact-counting protocol for anonymous dynamic networks
• Fault-tolerant aggregation: flow-updating meets mass-distribution

This page was built for publication: An early-stopping protocol for computing aggregate functions in Sensor Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q362558)