Abstract: Concerning long length of identification time and large amounts of data transmission in some binary search schemes, a new anti-collision algorithm was proposed. The algorithm adopted grouping strategy, and all tags in each subset were identified by reader in order. The grouping strategy could reduce the quantity of responding tags in each query and the probability of collision. On the other hand, tag ID was divided into two segments, the first seven bits were the first part and the remaining bits were the second part. Therefore, the transmission of redundant data could be reduced. The simulation results show that, compared with several other algorithms, the proposed algorithm has fewer searching times, and the data transmission is only one-sixth of Dynamic Binary Search Tree (DBS) algorithm. Thus, the identification efficiency of the proposed algorithm is significantly improved.

Key words: Radio Frequency Identification (RFID), anti-collision, binary tree, ALOHA, tag identification

摘要： 针对现有几种基于二叉树的防碰撞算法识别时延较长、数据传输量大的情况，提出一种新颖的防碰撞算法。算法采用分组策略，读写器按顺序依次识别每个分组，减少了每次应答标签的数量和碰撞发生的概率;此外，把标签ID分为两段识别，第一段为前7位，剩余部分为第二段，标签ID分段处理能减少冗余数据的传输。仿真结果表明，该算法相比其他几种算法，查询次数少，数据传输量仅为动态二叉树搜索(DBS)算法的1/6，识别效率有较大幅度提高。

关键词: 射频识别, 防碰撞, 二叉树, ALOHA, 标签识别