无线传感器网络数据环区域查询处理算法

Data Annular Areas Queryprocessing Agorithm in Wireless Sensor Networks

针对无线传感器网络节点能量高效问题以及Skyline查询位置属性决策问题,提出了基于无线传感器网络数据环区域查询处理算法。该算法以查询位置P为中心进行数据环划分,查询位置P最近的K个Skyline值时,根据剪枝策略只需对距离小于P的其它属性值进行比较,从而缩小了数据规模,提高了查询效率。另外,环内节点采用链簇式结构组织,环内查询处理过程采用串行数据处理与并行数据处理模式,从而提高了K-Skyline的数据查询能耗与节点处理延迟。仿真实验表明,数据环区域查询处理算法比Flooding算法与TAG算法具有更小的数据处理能耗和延迟。

For the energy-efficient nodes and Skyline query of the node position attribute decision problem existing in wireless sensor networks,an algorithm that Data annular areas query processing algorithm in wireless sensor networks is proposed.By this algorithm the entire area is separated into several data annulars by query centered position（p）.When query K-Skyline data of the close query position（p）,by pruning strategies only conducting compare with the other attribute values whose distance is less than p,it helps to reduce the data scope and raise the query efficiency.Furthermore,the annular node sub-area combined with a link-cluster structure,also with K-Skyline queries in different annular sub-areas can be processed with serial or parallel ways,the query cost and the query delay are both improved.Simulation studies show that this algorithm with less query cost and the query delay while compared to Flooding algorithm and TAG algorithm.