From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification

Su, Jian, Chen, Yongrui, Sheng, Zhengguo, Huang, Zhong and Liu, Alex X (2020) From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification. IEEE Transactions on Communications. p. 1. ISSN 0090-6778

[img] PDF - Accepted Version
Download (1MB)


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 Mary 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 BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost.

Item Type: Article
Schools and Departments: School of Engineering and Informatics > Engineering and Design
Research Centres and Groups: Advanced Communications, Mobile Technology and IoT (ACMI)
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101 Telecommunication
Depositing User: Zhengguo Sheng
Date Deposited: 16 Jan 2020 09:12
Last Modified: 23 Jan 2020 16:00

View download statistics for this item

📧 Request an update