Aggregation in dynamic networks

DOI10.1145/2332432.2332468MaRDI QIDQ2933795zbMATH OpenOpenAlexFDO

Authors Alejandro Cornejo, Calvin Newport, Seth Gilbert

Publication date 5 December 2014

Published in Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2332432.2332468

zbMATH Keywords

aggregationdynamic graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

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

Cited in

(10)

• The complexity of data aggregation in static and dynamic wireless sensor networks
• Continuous aggregation in dynamic ad-hoc networks
• Adaptive aggregation on graphs
• Convergecast tree on temporal graphs
• Distributed graph algorithms and their complexity: an introduction
• Some lower bounds in dynamic networks with oblivious adversaries
• The price of validity in dynamic networks
• Efficient Dynamic Aggregation
• Peer-to-peer aggregation techniques dissected
• The complexity of data aggregation in static and dynamic wireless sensor networks

This page was built for publication: Aggregation in dynamic networks

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