Continuous Probabilistic Count Queries in Wireless Sensor Networks

  • Anna Follmann
  • Mario A. Nascimento
  • Andreas Züfle
  • Matthias Renz
  • Peer Kröger
  • Hans-Peter Kriegel
Conference paper

DOI: 10.1007/978-3-642-22922-0_17

Volume 6849 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Follmann A., Nascimento M.A., Züfle A., Renz M., Kröger P., Kriegel HP. (2011) Continuous Probabilistic Count Queries in Wireless Sensor Networks. In: Pfoser D. et al. (eds) Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg

Abstract

Count queries in wireless sensor networks (WSNs) report the number of sensor nodes whose measured values satisfy a given predicate. However, measurements in WSNs are typically imprecise due, for instance, to limited accuracy of the sensor hardware. In this context, we present four algorithms for computing continuous probabilistic count queries on a WSN, i.e., given a query Q we compute a probability distribution over the number of sensors satisfying Q’s predicate. These algorithms aim at maximizing the lifetime of the sensors by minimizing the communication overhead and data processing cost. Our performance evaluation shows that by using a distributed and incremental approach we are able to reduce the number of message transfers within the WSN by up to a factor of 5 when compared to a straightforward centralized algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Anna Follmann
    • 1
  • Mario A. Nascimento
    • 2
  • Andreas Züfle
    • 1
  • Matthias Renz
    • 1
  • Peer Kröger
    • 1
  • Hans-Peter Kriegel
    • 1
  1. 1.Department of Computer ScienceLudwig-Maximilians-UniversitätGermany
  2. 2.University of AlbertaCanada