Abstract
In order to solve the problem of tag collision in Radio Frequency Identification (RFID) system, the paper proposes a Multi-Bit Identification Collision Tree (MICT) algorithm based on a collision tree. The algorithm uses an array scheme to mark the collision bits in the identification process, and determines the collision information according to the first few bits of the tag, which can effectively reduce the number of recognitions and the amount of communication data. The testing results show that the proposed algorithm reduces the time complexity by about 38% and the communication complexity by about 27% compared to existing collision-tree-based algorithms. Through theoretical analysis and experimental evaluation, the MICT algorithm has obvious advantages in terms of time and communication complexity compared to the other typical algorithms. The algorithm can be applied to the field of RFID-related systems to significantly improve the system efficiency.
Highlights
Radio Frequency Identification (RFID) technology is a non-contact intelligent identification technology
This paper mainly focuses on tag-tag collision problems
One of the effective ways of improving the recognition efficiency of the tree anti-collision algorithm is using the prefix updating of the collision bit according to the collision decoding situation
Summary
RFID technology is a non-contact intelligent identification technology. Compared to traditional automatic identification technology, it has the advantages of small volume, low cost, large storage, high security, and reusability. The deterministic algorithms ensure that all tags in the identified range are identified, but often do not perform well in communication efficiency Several algorithms such as tag grouping [16,17], bit tracking [18,19], and multi-bit identification have been proposed to improve the performance of RFID identification. Information 2018, 9, 63 makes full use of the collision information of a certain length, and uses a distinguishable grouping scheme to group the specific query prefixes. The algorithm only updates query prefix collision location, which reduces unnecessary queries and eliminates the idle time slot. The experimental thatnew the algorithm new algorithm a better performance in terms time complexity and communication complexity compared to existing algorithms.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
