基于P2P结构的kNN组查询算法

Group-query algorithm of framework for kNN query based on P2P system

着重讨论了基于P2P结构的移动对象kNN组查询算法。组查询算法采用建立计时区间的方法合并计时器,并通过改变临界物体的应答模式来优化临界物体间的通信协议。为降低移动对象资源的紧张程度,设计了区间计时算法和临界点信息处理算法以降低通信频率,减少响应次数,增强组查询的实时性。在模拟实验中,组查询算法有效降低了移动物体的CPU资源紧张程度和无线通信代价。

This paper studies the group-query algorithm of the framework for k-nearest neighbor（kNN） query based on peer-to- peer （P2P） system.Based on the capability of moving objects,a interzone-time algorithm and a critical algorithm are presented. Those two algorithms consolidate timers and optimize the communication protocol of the critical objects.So that the cost of CPU time and wireless communication can be reduced.In the simulation,the framework makes full use of group-query algorithm,and makes queries efficiently.