Skip to main navigation Skip to search Skip to main content

A note on efficient aggregate queries in sensor networks

Research output: Contribution to journal › Article › peer-review

23 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)254-264
Number of pages11
JournalTheoretical Computer Science
Volume370
Issue number1-3
DOIs
StatePublished - 12 Feb 2007

Keywords

  • Aggregate queries
  • Communication complexity
  • Median computation
  • Sensor networks

Fingerprint

Dive into the research topics of 'A note on efficient aggregate queries in sensor networks'. Together they form a unique fingerprint.

Cite this