基于R-Tree结构的无线传感器网络历史查询研究  

Study on history data query in wireless sensor network based on R-tree

作　　者：王立凯[1] 王丽梅[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《哈尔滨商业大学学报（自然科学版）》2008年第5期557-561,共5页Journal of Harbin University of Commerce：Natural Sciences Edition

基　　金：国家自然科学基金(60473075)

摘　　要：把整个无线传感器网络组织成类似于R-tree结构,区域的历史感知数据存储在该区域的数据存储节点上,查询时只需要查询数据存储节点,节省了查询需要的能量,而对历史非常久远的数据先进行压缩处理,再发送给基站存储,可防止数据丢失.实验证明,应用R-Tree的方法无论在存储还是在查询上都比本地存储法和基站存储法具有优越性.This paper proposes a method which can be used in history data storage and query. Undoubted, research on history data storage and query is of huge value in practical application, which includes many fields. For example, during implementation of wireless sensor network in environmental monitoring, it is necessary to query the static temperature during a time in some place, the history data query is essential. Two basic methods are referred： local storage and base station storage. Local storage requires for huge energy on data query and owns limited capacity, therefore, data is caused to lose easily; base station storage gains great capacity, but it costs quantity of energy either at storage. Both methods reveal their shortcomings obviously. This paper constructs the whole sensor network to R -Tree, and storage all sensor data in some range to the storage node. After dealer, the very old data will be sent to sink, and could be prevented from data losing. The experiment improves that this method is very efficient.

关 键 词：传感器网络 区域查询 R—Tree 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]