基于多叉树搜索算法改进的RFID防碰撞算法

An improved anti-collision algorithm based on multi-tree search in RFID

多标签碰撞问题严重影响了RFID系统的性能。为了更好地解决这一问题,提出了基于多叉树搜索的防碰撞算法。该算法根据碰撞位的不同来动态选择二叉树搜索和四叉树搜索,并引用堆栈存储查询命令以避免重复搜索和冗余搜索,使得在大批量标签的情况下,系统吞吐率大幅度提高。

Multi-tags collision seriously affect the performance of RFID systems,in order to better solve this problem, this paper presents the anti-collision algorithm based on the multi-branch tree search and selects binary tree search and quad tree search algorithm based on the different dynamics of the collision bits,it also references the stack to store query commands to avoid duplication and redundance of search,making the system throughput greatly improve in the case of very large number of tags.