一种新的RFID标签识别防冲突算法

在 RFID 网络通信中, 当多个标签同时回应阅读器的查询时, 如果没有相应的防冲突机制, 会导致标签到阅读器的通信冲突, 使得从标签返回的数据难以被阅读器正确识别. 防冲突算法是阅读器快速、正确获取标签数据的关键. 一种被称为基于栈的 ID-二进制树防冲突算法 (Stack-based ID-binary tree anti-collision algorithm, SIBT) 被提出, SIBT 算法的新颖性在于它将 n 个标签的 ID 号映射为一棵唯一对应的 ID-二进制树, 标签识别过程转化为在阅读器中创建ID-二进制树的过程. 为了提高多标签识别效率, 阅读器使用栈保存已经获取的ID-二进制树创建线索, 用计数器保存标签在该栈中的深度. 理论分析和仿真结果表明 SIBT 算法的性能优于其他基于树的防冲突算法.

A Novel Anti-collision Algorithm for Tag Identification in RFID Systems

In the RFID system,tag-to-reader communication collision occurs when more than one tag responds to a reader's interrogation at the same time.Without any coordination among the reader and the tags,the responses from the tags will become illegible to the reader.Anti-collision algorithms for passive RFID tag identification are significant for fast and correctly obtaining the tags ID.This paper presents a novel anti-collision algorithm which is called stack-based ID-binary tree anti-collision algorithm(SIBT).The novelty of the SIBT algorithm is that the algorithm maps a set of n tags into a corresponding ID-binary tree,and sees the process of collision arbitration as a process of building the ID-binary tree.In order to efficiently construct an ID-binary tree,the reader uses a stack to store the threads of the construction information while the tag uses a counter to keep track of the stack position where the tag is on.Both theoretic results and simulation performance evaluations show that the SIBT outperforms other tree based tag anti-collision algorithms.