Efficient and power-awareness query over sensor networks

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.     

Efficient and power-awareness query over sensor networks

Sensor networks consisted of low-cost, low-power, muhifunctional 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.     

Spatial aggregations for spatial based decision making in spatial data warehouses

For spatial based decision making such as choice of best place to construct a new department store, spatial data warehousing system is required more and more previous spatial data warehousing systems; however, provided decision making of non-spatial data on a map and so those cannot support enough spatial based decision making. The spatial aggregations are proposed for spatial based decision making in spatial data warehouses. The meaning of aggregation operators for applying spatial data was modified and new spatial aggregations were defined. These aggregations can support hierarchical concept of spatial measure. Using these aggregations, the spatial analysis classified by non-spatial data is provided. In case study, how to use these aggregations and how to support spatial based decision making are shown.     

Spatial aggregations for spatial based decision 

For spatial based decision making such as choice of best place to construct a new department store, spatial data warehousing system is required more and more previous spatial data warehousing systems; however, provided decision making of nonspatial data on a map and so those cannot support enough spatial based decision making. The spatial aggregations are proposed for spatial based decision making in spatial data warehouses. The meaning of aggregation operators for applying spatial data was modified and new spatial aggregations were defined. These aggregations can support hierarchical concept of spatial measure. Using these aggregations, the spatial analysis classified by nonspatial data is provided. In case study, how to use these aggregations and how to support spatial based decision making are shown.