Aggregation in dynamic networks

DOI10.1145/2332432.2332468zbMATH Open1301.68202OpenAlexW2085128250MaRDI QIDQ2933795FDOQ2933795

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

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

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)

Cited In (11)

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