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

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