Abstract
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.
Highlights
Recently, with the rapid development of Internet of things (IoT), Integrated circuits (IC), and communication networks, and the gradual reduction in application costs of RFID systems, RFID has been widely used in various applications including inventory control and supply chain management
When the reader probes the tags within its coverage, it may happen that multiple tags simultaneously respond to the reader, which is called a tag collision problem
In the Smart Batch-Processing protocol (SBP), once the reader detects a tag collision, it will first form an optimal M -ary traversal tree and send a batch processing command to allow multiple tags to be identified in a slot
Summary
With the rapid development of Internet of things (IoT), Integrated circuits (IC), and communication networks, and the gradual reduction in application costs of RFID systems, RFID has been widely used in various applications including inventory control and supply chain management. The main idea of a tree-based algorithm is to maintain the string before the highest collision bit as the common prefix when the reader detects a collision, and divides the collided tag set according to the collision bits. The above work focuses on decrease the times of interactions between the reader and tags and the number of transmitted bits. Their performance needs to be further improved because of a redundant prefix, unused collided bits, and idle paging. In SBP, when a collision occurs, the reader first detects the actual distribution of m-bit collision bits through a BQ command (After receiving the BQ command, the tag will generate 2m mapped string based on the value of original m bits).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
