A note on efficient aggregate queries in sensor networks

DOI10.1016/j.tcs.2006.10.032zbMath1118.68016OpenAlexW1967939903MaRDI QIDQ868957

Boaz Patt-Shamir

Publication date: 26 February 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.032

zbMATH Keywords

communication complexitysensor networksaggregate queriesmedian computation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (2)

Towards worst-case churn resistant peer-to-peer systems ⋮ Near-Optimal Distributed Maximum Flow

Uses Software

• TAG

Cites Work

• Unnamed Item
• The space complexity of approximating the frequency moments
• A result in order statistics related to probabilistic counting
• The Probabilistic Communication Complexity of Set Intersection
• Distributed Computing: A Locality-Sensitive Approach
• Communication Complexity
• A note on efficient aggregate queries in sensor networks
• Algorithms - ESA 2003

This page was built for publication: A note on efficient aggregate queries in sensor networks