OMSI-tree: Power-awareness query processing over sensor networks by removing overlapping regions

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Sensor networks have played an important role in our daily life. The most common applications are light and humidity monitoring, environment and habitat monitoring. Window queries over the sensor networks become popular. However, due to the limited power supply, ordinary query methods can not be applied on sensor networks. Queries over sensor networks should be power-aware to guarantee the maximum power savings. In this paper, we concentrate on minimal power consumption by avoiding the expensive communication. A lot of work have been done to reduce the participated nodes, but none of them have considered the overlapping minimum bounded rectangle (MBR) of sensors which make them impossible to reach the optimization solution. The OMSI-tree and OMR algorithm proposed by us can efficiently solve this problem by executing a given query only on the sensors involved. Experiments show that there is an obvious improvement compared with TinyDB and other spatial index, adopting the proposed schema and algorithm. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Zha, W., Eo, S. H., You, B. S., Lee, D. W., & Bae, H. Y. (2007). OMSI-tree: Power-awareness query processing over sensor networks by removing overlapping regions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4537 LNCS, pp. 204–210). Springer Verlag. https://doi.org/10.1007/978-3-540-72909-9_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free