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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Eo, S. H., Pandey, S., Park, S. Y., & Bae, H. Y. (2006). Energy efficient design for window query processing in sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3842 LNCS, pp. 310–314). https://doi.org/10.1007/11610496_41
Mendeley helps you to discover research relevant for your work.