Continuous Approximate Window Queries in Wireless Sensor Networks

  • Bin Wang
  • Xiaochun Yang
  • Guoren Wang
  • Ge Yu
Conference paper

DOI: 10.1007/978-3-540-72524-4_43

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4505)
Cite this paper as:
Wang B., Yang X., Wang G., Yu G. (2007) Continuous Approximate Window Queries in Wireless Sensor Networks. In: Dong G., Lin X., Wang W., Yang Y., Yu J.X. (eds) Advances in Data and Web Management. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg

Abstract

Wireless sensor networks are demonstrating the valuable potential in a variety of settings, e.g. data analysis and statistics. How to minimize energy consumption and prolong network lifetime become one of the key challenges. In this paper, we propose a continuous approximate window query technique called CWQ to approximately collect data in a specified region in a wireless sensor network. CWQ clusters sensors in the network into several clusters, in which sensors have similar readings. We study how to discover a minimal path to concatenate clusters under non-failure as well as failure cases. Our experiments show that CWQ can provide significant communication (and hence energy) savings.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Bin Wang
    • 1
  • Xiaochun Yang
    • 1
  • Guoren Wang
    • 1
  • Ge Yu
    • 1
  1. 1.School of Information Science and Engineering, Northeastern University, 110004China

Personalised recommendations