TMIA: A Tree-Based Multi-Reader Interactive Anti-Collision Algorithm for RFID Tag Identification

Jianhua Song,Hui Yao,Shuai He

doi:10.1109/access.2020.2991027

Jianhua Song, Hui Yao + Show 1 more

Open Access

https://doi.org/10.1109/access.2020.2991027

Copy DOI

Abstract

In the RFID system, the tag collision problem seriously affects the efficiency of tag identification. Among the anti-collision algorithms, tree-based anti-collision algorithms are popular for the reason that they can ensure that the tags can theoretically 100% be identified by readers. As multi-reader scenarios are more and more widely used in complex internet of things environments, there are more collision slots and idle slots in traditional anti-collision algorithms, which affects the efficiency of the algorithm. We propose a tree-based multi-reader interactive anti-collision algorithm (TMIA) for multi-reader tag identification scenarios to solve the problems above. Readers optimize the broadcast prefix sequence by sharing the broadcast results. The proposed algorithm works in two phases: In the first phase, the reader selects a suitable broadcast prefix by the multi-reader inverse probability function (MIPF) to reduce the initial redundant collision in tag identification. In the second phase, the priority of the broadcast prefix is adjusted through the information exchange between readers, the readers thus avoid broadcasting a large number of invalid prefixes. Theoretical analysis and simulation results show that TMIA has a lower total number of slots and better system efficiency than existing tree-based algorithms. TMIA also greatly reduce the number of collision slots.

Highlights

Radio frequency identification (RFID) is a non-contact automatic identification technology that uses radio waves as a transmission medium to accomplish bidirectional data communication [1], [2]
treebased multi-reader interactive anti-collision algorithm (TMIA) focuses on the benefits of different broadcast results to tag anti-collision, especially the idle slots, which were useless for their own reader but can increase the tag identification efficiency for other readers
TMIA is compared with three relative algorithms (PQT [23], Optimal Query Tracking Tree (OQTT) [31], improved 4-ary query tree algorithm (I4QT) [32]) which are enhanced from query tree (QT)

Summary

INTRODUCTION

Radio frequency identification (RFID) is a non-contact automatic identification technology that uses radio waves as a transmission medium to accomplish bidirectional data communication [1], [2]. We found that the broadcast result of a single reader has benefit to other readers, we use this benefit to improve the efficiency of the tree-based algorithm, which avoids a large number of potential collision slots. Besides the perspective of optimizing the initial subset, the anti-collision algorithms based on the multi-ary query tree have achieved good results in tags identification. It can be expressed as a B-ary tree(B 2), [33] proved that the best performance when the value of B is 3, but for all tags to be recognized in the tree structure, ‘B’ should be in the form of 2n( n 1), an increase in the value of B results in a decrease in the number of collision slots, while the number of idle slots gradually increases. A few cases will mislead the reader to choose wrong nodes to broadcast, so it can be concluded that the error of probability is always within the controllable range

TOTAL NUMBER OF SLOTS

SIMULATION RESULTS

CONCLUSION