改进的树型结构RFID防碰撞算法

Improved tree structure anti-collision algorithm of RFID

将整棵大查询树分为若干分支,在每一个分支内进行标签识别,减少碰撞发生的概率。算法分为前缀确定和分支查询2个阶段,在前缀确定阶段读取所有标签前缀,每个前缀代表一个分支,依次遍历每一分支;查询过程采用后退式搜索策略和动态搜索方式。理论分析和仿真实验表明,算法能够从查询次数、时延、吞吐率多方面改善RFID系统的整体性能。

The whole big query tree is divided into several branches, and the work of tag recognition is executed in each branch, thus reducing the probability of tag collision. The proposed algorithm can be divided into prefix determination and branch query two phases. In the prefix determination phase, the prefix of every tag is identified, and each prefix denotes a branch. Traverse each branch by turns to recognize tags; in the branch query phase, backward search strategy and dynamic search method are used. Theoretical analysis and simulation experiment show that when the improved algorithm can improved the overall performance of RFID system from the aspects of the number of queries, time delay, and throughput.