针对以往事件查询中事件查询速度不够快、成功率不高及网络寿命不长等问题,提出一种在速度、成功率与网络寿命等方面取得较好效果的事件查询策略。该策略的主要要点是:不同于以往研究中随机扩散的方式,在事件信息存储时,先基于哈希函数,将事件信息存储到哈希函数映射所指示的跳数相同的一段连续节点上;在事件查询时,依据同样的哈希函数,向哈希函数所指示的方向路由,以最小的路由代价获得事件信息。给出了此策略的查询与存储代价,并采用Omnet++网络模拟器进行仿真实验,与经典事件查询算法进行的对比。研究结果表明:本文的策略具有很好的性能,对相关应用具有较好的指导意义。
Considering that the event query cannot achieve the expected results at high speed, high success rate, and with long lifetime in the past, a better event query strategy with high speed, high success rate and long lifetime in event query was proposed. The main points of the strategy were as follows. Different from the previous research in stochastic diffusion way, the event information storage was based on hash function, and the event information was stored to the same hops of a length of continuous nodes instructed by the hash function mapping. The event information could be acquired at a minimum routing cost which was routed in the direction instructing by the same hash function in event query. The strategy query and storage costs were shown, and the experiments with Omnet++ network simulator was simulated. The results show that the strategy is of better performance compared with traditional event query algorithm and it performs a good guiding significance for related applications.