论文部分内容阅读
现有传感器网络环境下的K近邻查询处理算法没有考虑节点失效对查询处理的影响,导致查询结果极易丢失.提出一种基于环扇区的数据收集算法RISC,以保证查询处理过程的鲁棒性.给出理论上最节省能量的环扇区大小设置,以减少算法的能量消耗.系统地分析了算法在不同节点密度、节点失效概率和查询区域条件下的查询成功率和能量消耗.实验结果表明,在绝大多数情况下,提出的基于环扇区的K近邻查询处理算法优于现有的基于路线的算法.
In the existing sensor network environment, K-nearest neighbor query processing algorithm does not consider the effect of node failure on query processing, resulting in easy loss of query results.A data collection algorithm RISC based on ring sector is proposed to ensure the robustness of query processing This paper gives theoretically the most energy-saving setting of the ring sector size in order to reduce the energy consumption of the algorithm, and systematically analyzes the query success rate and energy consumption of the algorithm under different node density, node failure probability and query area conditions. The results show that, in the vast majority of cases, the algorithm proposed in this paper is superior to the existing route-based algorithms in K-Neighbor Polling based on ring sectors.