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

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