无空闲时隙的动态多叉查询树RFID防碰撞算法

DYNAMIC N-ARY QUERY TREE RFID ANTI-COLLISION ALGORITHM WITHOUT IDLE TIMESLOTS

为了提高RFID系统识别标签的效率,提出一种无空闲时隙的动态多叉查询树RFID防碰撞算法DMQT。该算法根据碰撞位的特征动态调整树分裂的叉数,能够有效地减少碰撞时隙。通过跟踪标签的碰撞位来避免不存在标签的分支,从而可以消除空闲时隙。理论和仿真分析可以看到,该算法具有很小的识别时隙和较大的吞吐率,算法性能优于目前存在的RFID防碰撞算法。

In order to improve the efficiency of RF I D system in identifying tags, this paper presents a dynamic n-ary query tree RFID anticollision algorithm without idle timeslots ( D M Q T ). D M Q T adjusts dynamically the number of branches of the tree according to the characteristics of collision bits,and is able to reduce effectively the collision timeslots. D M Q T avoids some branch that tags do not exist by tracking the tag collision bits,so that it can eliminate all the idle timeslots. It can be seen from theoretical and simulation analyses that DMQT has a small total timeslots and larger throughput, its performance outperforms existing R F I D anti-collision algorithms.