Efficient Dynamic Aggregation

DOI10.1007/11864219_7MaRDI QIDQ3524297zbMATH OpenOpenAlexFDO

Authors Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster

Publication date 9 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11864219_7

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Aggregation in dynamic networks
• Continuous aggregation in dynamic ad-hoc networks
• Almost-optimal gossip-based aggregate computation
• The complexity of data aggregation in static and dynamic wireless sensor networks
• The price of validity in dynamic networks

Cited in

(10)

• LiMoSense: live monitoring in dynamic sensor networks
• Fault-tolerant aggregation: flow-updating meets mass-distribution
• Aggregation in dynamic networks
• Peer-to-peer aggregation techniques dissected
• Aggregation in Dynamic Programming
• Optimal plans for aggregation
• Veracity radius, capturing the locality of distributed computations
• Continuous aggregation in dynamic ad-hoc networks
• The price of validity in dynamic networks
• Spatially-decaying aggregation over a network

This page was built for publication: Efficient Dynamic Aggregation

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