Cost-efficient processing of MIN/MAX queries over distributed sensors with uncertainty

  • Authors:
  • Zhenyu Liu;Ka Cheung Sia;Junghoo Cho

  • Affiliations:
  • University of California, Los Angeles, CA;University of California, Los Angeles, CA;University of California, Los Angeles, CA

  • Venue:
  • Proceedings of the 2005 ACM symposium on Applied computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The rapid development in micro-sensors and wireless networks has made large-scale sensor networks possible. However, the wide deployment of such systems is still hindered by their limited energy which quickly runs out in case of massive communication. In this paper, we study the cost-efficient processing of aggregate queries that are generally communication-intensive. In particular, we focus on MIN/MAX queries that require both identity and value in the answer. We study how to provide an error bound to such answers, and how to design an "optimal" sensor-contact policy that minimizes communication cost in reducing the error to a user-tolerable level.