A note on efficient aggregate queries in sensor networks

DOI10.1145/1011767.1011809zbMath1321.68032OpenAlexW2058568831MaRDI QIDQ5501508

Boaz Patt-Shamir

Publication date: 3 August 2015

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

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

zbMATH Keywords

mediancommunication complexitysensor networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Related Items

Approximate distributed top-\(k\) queries, A note on efficient aggregate queries in sensor networks, Sketching asynchronous data streams over sliding windows, Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions, The Complexity of Data Aggregation in Directed Networks