Research and optimization of RFID tag anti-collision algorithm

Miao Bai; ZhiYing Yang

doi:10.1117/12.2682439

26 May 2023 Research and optimization of RFID tag anti-collision algorithm

Miao Bai, ZhiYing Yang

Proceedings Volume 12700, International Conference on Electronic Information Engineering and Data Processing (EIEDP 2023); 127002A (2023) https://doi.org/10.1117/12.2682439
Event: International Conference on Electronic Information Engineering and Data Processing (EIEDP 2023), 2023, Nanchang, China

Abstract

In order to reduce the total identification time of readers and improve the system throughput in Radio Frequency Identification (RFID) systems, a new algorithm is proposed. Based on the Frame-Slotted ALOHA (FSA) algorithm, Tags are grouped according to the number of time slots during the reader's recognition process. For tags in collision time slots after a frame ends, the Collision Tree (CT) algorithm is used for group recognition, solving the starvation problem of the FSA algorithm and significantly reducing the total identification time of the reader. Simulation experiments have demonstrated that the algorithm proposed by the author significantly reduces the processing time when compared to the CT algorithm. and achieves a throughput rate that is higher than the traditional CT algorithm When the number of tags exceeds 260, reaching a maximum of 52% when the number of tags is around 400.

Citation Download Citation

Miao Bai and ZhiYing Yang "Research and optimization of RFID tag anti-collision algorithm", Proc. SPIE 12700, International Conference on Electronic Information Engineering and Data Processing (EIEDP 2023), 127002A (26 May 2023); https://doi.org/10.1117/12.2682439

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available