The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based M-ary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQ-MDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost.

中文翻译：

---

从 M-ary Query 到 Bit Query：一种高效大规模 RFID 识别的新策略

标签冲突避免已被视为 RFID 通信中最重要的研究问题之一，位跟踪技术已广泛嵌入基于查询树 (QT) 的算法中以应对此类挑战。现有的解决方案显示出进一步提高读取性能的机会，因为没有充分探索碰撞查询和空查询。本文提出了一种基于多元查询树协议（BQMT）的比特查询（BQ）策略，它不仅可以消除空闲查询，而且可以将冲突的标签分成许多小的子集，充分利用冲突的比特。为了进一步优化读取性能，提出了一种改进的双前缀匹配（MDPM）机制，允许多个标签在同一个时隙中响应，从而显着减少查询次数。补充理论分析和模拟以验证所提出的 BQMT 和 MDPM 的有效性，它们优于现有的基于 QT 的算法。此外，BQMT 和 MDPM 可以结合到 BQ-MDPM 中，以提高系统效率、总识别时间、通信复杂度和平均能源成本方面的读取性能。