Efficient Distributed Selection with Bounded Messages
IEEE Transactions on Parallel and Distributed Systems
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A note on efficient aggregate queries in sensor networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Power-conserving computation of order-statistics over sensor networks
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Communication Complexity
Distributed computation of the mode
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Securely computing an approximate median in wireless sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
Secure median computation in wireless sensor networks
Ad Hoc Networks
Towards in-network data prediction in wireless sensor networks
Proceedings of the 2010 ACM Symposium on Applied Computing
TIDES--a new descriptor for time series oscillation behavior
Geoinformatica
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
An adaptive refinement-based algorithm for median queries in wireless sensor networks
Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 5.23 |
We consider a scenario where nodes in a sensor network hold numeric items, and the task is to evaluate simple functions of the distributed data. In this note we present distributed protocols for computing the median with sublinear space and communication complexity per node. Specifically, we give a deterministic protocol for computing median with polylog complexity and a randomized protocol that computes an approximate median with polyloglog communication complexity per node. On the negative side, we observe that any deterministic protocol that counts the number of distinct data items must have linear complexity in the worst case.