Paper Info
Title
OMSI-Tree: Power-Awareness Query Processing over Sensor Networks by Removing Overlapping Regions
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 he 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.
Year
DOI
Venue
2007
10.1007/978-3-540-72909-9_21
ADVANCES IN WEB AND NETWORK TECHNOLOGIES, AND INFORMATION MANAGEMENT, PROCEEDINGS
Keywords
Field
DocType
minimum bounding rectangle,spatial index,sensor network
Sensor node,Key distribution in wireless sensor networks,Computer science,Rectangle,Range query (data structures),Real-time computing,Maximum power principle,Wireless sensor network,Spatial database,Bounded function
Conference
Volume
ISSN
Citations 
4537
0302-9743
0
PageRank 
References 
Authors
0.34
9
5
Name
Order
Citations
PageRank
Wei Zha1689.52
Sang Hun Eo2193.52
Byeong-Seob You381.94
Dongwook Lee441862.32
Hae-Young Bae57831.47