基于可离散处理的RFID防碰撞混杂算法研究

Research on RFID anti-collision hybrid algorithm based on discrete processing

针对一类二叉树搜索算法存在寻呼次数过高的应用局限,采用二叉树查询和离散处理相结合的方法,提出了RFID防碰撞混杂算法。理论分析表明,与以往算法不同,该算法实质上是对满足可离散处理特征的模式而非个体的标签进行二叉树搜索。算法充分考虑了阅读器寻呼次数、寻呼开销、吞吐率等重要的性能指标。仿真结果验证了该算法在寻呼次数、吞吐率等性能指标上有明显的提升。

A kind of binary tree search algorithms hav distinct application limitations such as high number of requests in case that a fairly large number of tags are available. A hybrid anti-collision algorithm was proposed, combining binary tree search with discrete processing. Theoretic analysis show that, different from available schemes, the algorithm essentially performs binary tree search not on a single tag, but on models which identify the property of discrete procession. The proposed algorithm fully takes the time of request into account, as well as power consumption and throughput of the system. Simulation result verifies that the algorithm achieves much better performances such as the time of request and throughput than the previous algorithms.