Energy efficient design for window query processing in sensor networks

  • Authors:
  • Sang Hun Eo;Suraj Pandey;Soon-Young Park;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 Computer Science and Information Engineering, Inha University, Incheon, Korea

  • Venue:
  • APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.03

Visualization

Abstract

In this paper, we propose an energy efficient design for window query processing in sensor networks. A new design is structured to process the window queries. The use of distributed form of spatial indexing introduces greater flexibility and robustness as compared to the previous centralized approach, which lacked proper semantics and evaluation of window queries, in sensor networks. A distributed spatial routing tree efficiently distributes the structure to each node in the sensor network. The MBR of the region where its children and the node itself are located is stored by each parent. The measure of the extent of overlapping determines the inclusion/exclusion of sensor nodes to evaluate the query. Reduction in the number of nodes participating in the query reduces the communication power seeked, thus elongating the life of the embedded sensor system.