In Radio Frequency Identification (RFID) systems, the reader identifies tags through communications over a shared wireless channel. However, when multiple tags transmit their IDs simultaneously, their signals collide, thereby prolonging the identification delay. However, in some applications, the RFID system has the availability of a database containing the IDs of all the tags that may possibly appear. The present study proposes a novel knowledge-based Query Tree with Shortcutting and Couple Resolution (QTSC) protocol for reducing the identification delay in RFID systems with such a database. In the proposed protocol, a knowledge-based query tree is first constructed to store the queries required to identify all the possible tags in the database. Then, at identifying appearing tags, the tags actually appear among possible tags, shortcutting and couple-resolution techniques are employed to skip redundant queries in the query tree and transmit two ID prefixes simultaneously within the same slot, respectively. The simulation results show that compared to the existing knowledge-based protocols, Knowledge Query Tree (KQT) and Heuristic Query Tree (HQT) protocols, QTSC reduces the identification delay by 60.5% and 39.0%, respectively.

在射频识别（RFID）系统中，读取器通过共享无线信道上的通信来识别标签。但是，当多个标签同时发送其ID时，它们的信号发生冲突，从而延长了识别延迟。然而，在某些应用中，RFID系统具有数据库的可用性，该数据库包含可能出现的所有标签的ID。本研究提出了一种新颖的基于知识的查询树，具有捷径和耦合分辨率（QTSC）协议，可减少具有此类数据库的RFID系统中的识别延迟。在提出的协议中，首先构造了一个基于知识的查询树，以存储识别数据库中所有可能标签所需的查询。然后，在识别出现的标签时，这些标签实际上会出现在可能的标签中，使用快捷方式和夫妇解析技术来跳过查询树中的冗余查询，并分别在同一时隙内同时发送两个ID前缀。仿真结果表明，与现有的基于知识的协议，知识查询树（KQT）和启发式查询树（HQT）协议相比，QTSC分别将识别延迟减少了60.5％和39.0％。