基于查询树的双向分段防碰撞算法

Bi-direction segmented anti-collision algorithm based on query tree

针对射频识别系统中由多标签碰撞导致系统效率低的问题,提出了一种基于查询树算法的防碰撞算法,意在减少系统能量损耗以及提高通信效率。该方法将标签分两组并将ID分段,使两组标签分别响应查询命令中的前缀和后缀,且根据查询命令中的状态码,只传输查询段的部分ID序列。与传统的查询树算法比较,该算法显著减少了对识别过程无用的比特信息的传输,消除了空闲时隙,同时提高了系统吞吐率。理论分析和仿真结果表明:本文算法优于现有的查询树防碰撞算法,有助于设计高效的RFID识别系统。

Focusing on the problem of the low system efficiency caused by multi-tags collision of RFID system,this paper proposes an anti-collision algorithm based on query tree,intended to reduce system energy consumption and improve communication efficiency. The method divides the tags into two groups and segments the IDs so that the tags respectively respond to the prefix and suffix in the query command and only transmit the partial ID sequence of the query segment according to the state code. Compared with the traditional query tree algorithm,the algorithm significantly reduces the transmission of bits useless for identification, eliminates idle time slots, and improves system throughput. Theoretical analysis and simulation results show that the proposed algorithm performs better than the existing query tree anticollision algorithm and helps to design an efficient RFID identification system.