关键词: 射频识别, 标签碰撞, 确定性算法, 防碰撞

Abstract: According to the principle of “fully using known information，not requesting or responding reduplicated information”，an anti-collision searching algorithm of delaminating deepness tree in RFID system is proposed，which adopts the method of “detecting the collision in the feedback sequence of tags to obtain the parameters of next request” and is based on the binary tree algorithm.After the methods mentioned above，“stack technology” and “back mechanism” are used，delaminating deepness searching tree anti-collision algorithm attains the goal of quick identification and especially fits the environment which contains large quantity of tags or tags with long ID.Mathematics analysis and simulation results show that the algorithm improves the identification speed and outperforms the existing ones.

Key words: Radio Frequency Identification（RFID）, anti-collision, deterministic algorithm, tag-collision