Efficient and power-awareness query over sensor networks |
| |
Authors: | ZHA Wei Sang-Hun Eo Ho-Seok Kim Sook-Kyoung Cho Hae-Young Bae |
| |
Affiliation: | Dept. of Computer Science & Information Engineering, Inha University, Incheon 402-751 Korea |
| |
Abstract: | Sensor networks consisted of low-cost, low-power, multifunctional miniature sensor devices have played an important role in our daily life. Light and humidity monitoring, seismic and animal activity detection, environment and habitat monitoring are the most common applications. However, due to the limited power supply, ordinary query methods and algorithms can not be applied on sensor networks. Queries over sensor networks should be power-aware to guarantee the maximum power savings. The minimal power consumption by avoiding the expensive communication of the redundant sensor nodes is concentrated on. 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 proposed OMSI-tree and OMR algorithm 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. |
| |
Keywords: | sensor networks query power-sensitive MBR |
本文献已被 维普 万方数据 等数据库收录! |
| 点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《重庆邮电大学学报(自然科学版)》下载全文 |