Abstract: Since specific cloned tags can’t be detected using only ID in large-scale RFID systems, a fast cloned tags detection algorithm, CTDA algorithm, is proposed. Firstly, tags storage [k] numbers Hash function, and reply reader [k] times within a frame constructing to build virtual Bloom filter through which tags set [M] in the reader communication area can be find quickly. Secondly, tags on set [M] perform several rounds of Hash algorithm to make the reader to build time-slot state vector. The purpose is to assign each tag a single time-slot. Finally, tags on set [M] reply the reader back with 10 bit information. The reader judges whether the label is being cloned by examining whether a single time-slot becomes into a conflict time-slot. Through the simulation analysis, it proves that the algorithm has quicker execution time than GREAT algorithm and RIP algorithm.

Key words: Radio Frequency Identification（RFID）, cloned tags detection, Bloom filter, multi-Hash function, conflict time-slot

摘要： 针对大型的RFID系统中使用标签ID无法识别具体复制标签的问题，提出了一种快速检测复制标签的CTDA算法。首先，标签内存储[k]个哈希函数，标签在接收到阅读器的查询帧后多次回复阅读器构造虚拟克鲁姆过滤器，找到阅读器通信区域内的标签集合[M]；然后，[M]中标签通过多轮哈希运算使得阅读器构建时隙状态向量，目的是给每个标签分配单一时隙；最后，标签向阅读器回复10 bit信息，阅读器通过检测各个时隙是否由单一时隙变成冲突时隙来判断标签是否受到复制。经过仿真分析，证明该算法在执行时间上优于Bu K提出的GREAT算法和Qiao Yan提出的轮询协议RIP算法。

关键词: 无线射频识别, 复制标签识别, 克鲁姆过滤器, 多哈希函数, 冲突时隙