Abstract: To resolve the problem of the tree-based anti-collision algorithm which produces many idle time slots and collision time slots, it makes RFID system a lower efficiency, a dynamic tree structure anti-collision algorithm based on collision segmentation（DTCS） is proposed. Considering with the increase of search layers, the number of tags in the collision nodes and tags non-recognition sequence collision probability is reduced, this paper effective uses the conflict bit distribution information, extracts every collision node tag query segment [N] according to the rules, combines with the coding mechanism, determines the query prefix and optimizes query command. Theory analysis and simulation results show that the new algorithm avoids idle time slots, shortens the search depth quickly, then can reduce the delay of tag identification and improve the throughput of the system up to 0. 649.

Key words: Radio Frequency Identification（RFID）, anti-collision, collision segmentation, query segment, coding

摘要： 针对射频识别系统中，基于树的防碰撞算法因存在较多空闲时隙和碰撞时隙导致系统效率低的问题，提出了基于冲突分段的动态树型防碰撞算法（DTCS）。新算法充分考虑随着搜索层数增加，碰撞节点内标签数量减少，标签未识别序列碰撞概率降低这一特点，有效利用冲突位分布信息，按规则提取每一碰撞节点标签查询段[N]，结合编码机制，确定查询前缀，优化查询命令。理论分析和仿真结果表明，新算法避免了空闲时隙，快速缩短了搜索深度，从而降低标签识别时延，系统吞吐率提高达0.649。

关键词: 射频识别, 防碰撞, 冲突分段, 查询段, 编码