FDSI-Tree: a fully distributed spatial index tree for efficient & power-aware range queries in sensor networks

  • Authors:
  • Sang Hun Eo;Suraj Pandey;Myung-Keun Kim;Young-Hwan Oh;Hae-Young Bae

  • Affiliations:
  • Department of Computer Science and Information Engineering, Inha University, Incheon, Korea;Department of Computer Science and Information Engineering, Inha University, Incheon, Korea;Department of Computer Science and Information Engineering, Inha University, Incheon, Korea;Department of Information Science, Korea Nazarene University, Choongnam, S. Korea;Department of Computer Science and Information Engineering, Inha University, Incheon, Korea

  • Venue:
  • SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a fully distributed spatial index tree (FDSI-tree) is proposed for efficient & power-aware range queries in sensor networks. The proposed technique is a new approach for range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. However, previous works just addressed the importance but didn’t provide any efficient technique for processing range queries. A FDSI-tree is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.