Multi-root, Multi-Query Processing in Sensor Networks

  • Authors:
  • Zhiguo Zhang;Ajay Kshemkalyani;Sol M. Shatz

  • Affiliations:
  • Department of Computer Science, University of Illinois at Chicago, Chicago, 60607;Department of Computer Science, University of Illinois at Chicago, Chicago, 60607;Department of Computer Science, University of Illinois at Chicago, Chicago, 60607

  • Venue:
  • DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make optimizing query processing particularly important. This paper addresses for the first time, multi-root, multi-query optimization for long duration aggregation queries. The paper formulates three algorithms - naive algorithm (NMQ), which does not exploit any query result sharing, and two proposed new algorithms: an optimal algorithm (OMQ) and a heuristic (zone-based) algorithm (ZMQ). The heuristic algorithm is based on sharing the partially aggregated results of pre-configured geographic regions and exploits the novel idea of applying a grouping technique by using the location attribute of sensor nodes as the grouping criterion. Extensive simulations indicate that the proposed algorithms provide significant energy savings under a wide range of sensor network deployments and query region options.