Abstract
Radio Frequency Identification (RFID) technology is a contactless automatic identification technology. With the wide application of this technology in many fields, anti-collision algorithm to solve the problem of multi-tag identification becomes more and more important. The current RFID anti-collision algorithm is mainly divided into two categories: ALOHA based algorithm and tree based algorithm. The traditional tree based anti-collision algorithm has a long time and low efficiency. Based on this, this paper proposed an improved RFID anti-collision algorithm based on quad-tree. It can eliminate idle timeslots of the identification process by grouping and re-encoding the original ID code of electronic tag. The mathematical analysis and simulation results show that the identification performance of the proposed algorithm is greatly improved compared with other traditional tree based algorithms.
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.
