Tight bounds for delay-sensitive aggregation

DOI10.1145/1400751.1400778MaRDI QIDQ2934345zbMATH OpenOpenAlexFDO

Authors Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer

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

aggregationonline algorithmscompetitive analysiswireless sensor networks

Mathematics Subject Classification ID

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

Recommendations

• Tight bounds for delay-sensitive aggregation
• Online control message aggregation in chain networks
• Latency Constrained Aggregation in Chain Networks Admits a PTAS
• Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
• \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation

Cited in

(7)

• Online control message aggregation in chain networks
• Latency Constrained Aggregation in Chain Networks Admits a PTAS
• Approximating Multiple Arrival Streams by Using Aggregation
• Scheduling algorithms for tree-based data collection in wireless sensor networks
• Tight bounds for delay-sensitive aggregation
• Brief announcement: Delay or deliver dilemma in organization networks
• Competitive analysis of organization networks or multicast acknowledgment: how much to wait?

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

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