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

摘要： 根据“完全利用已知信息，不发送或反馈重复信息”的原则，采用“判定标签反馈序列的冲突，得到下一步深度搜索参数”的方法，同时有效利用“堆栈技术”及“后退原则”，以二进制搜索算法为基础，提出了分层深度搜索树型RFID防碰撞算法。数学分析和仿真结果表明：分层深度搜索树型RFID防碰撞算法性能显著优于查询树、动态查询树、二进制搜索算法，尤其适用于标签数量多、ID长度较长的RFID应用环境。

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