Tight bounds for delay-sensitive aggregation

DOI10.1145/1400751.1400778zbMath1301.68149OpenAlexW2170949434MaRDI QIDQ2934345

Roger Wattenhofer, Stefan Schmid, Yvonne Anne Oswald

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

aggregationcompetitive analysisonline algorithmswireless sensor networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks ⋮ Latency Constrained Aggregation in Chain Networks Admits a PTAS

This page was built for publication: Tight bounds for delay-sensitive aggregation