Smart Batch-Processing Protocol for RFID Multiple Tag Identification

• Main Authors: Xiaojiao Yang, Xinxin Liu, Bizao Wu
• Format: Article
• Language: English
• Published: IEEE 2020-01-01
• Series: IEEE Access
• Subjects: Anti-collision; batch-processing; <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">m</italic>-ary; radio frequency identification; time efficient
• Online Access: https://ieeexplore.ieee.org/document/9179770/

The common paradigm of the RFID network is to obtain data from multiple tags through a reader. The tag collision problem seriously affects the efficiency of tag identification. The anti-collision algorithm provides a reliable guarantee to identify multiple tags as fast as possible. Many papers have proposed query tree algorithms based on bit tracking, but these algorithms still have problems such as idle paging and redundant prefixes. In this paper, we start with an analysis of state-of-the-art anti-collision algorithms. Based on summarizing current works, we propose a Smart Batch-Processing protocol (SBP) for RFID multiple tag identification based on M-ary collision bit arbitration mechanism. In the SBP, the reader firstly maps m-bit collision bits into 2^m slots and then predicts the distribution of tags in slots. Finally, the reader allows the tag to return the remaining part of its ID at the mapped slot using a batch-processing command. By using SBP, the reader can simultaneously identify 2^m groups of tags in a slot. Besides, empty queries can be eliminated in the tag identification process. The description of SBP is given first, and then, its performance is theoretical analyzed and simulated. Both theoretical analysis and extensive simulation results show that the SBP algorithm reduces 22.94% and 22.28% of time and energy consumption compared to other M-ary collision bit arbitration based methods.