Research on Dynamic Framed Binary Tree Anti-collision Algorithm for RFID System

Authors

Xiaohong Zhang, School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, China;
Weihui Zhou, School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, China;

Abstract

Abstract: Based on dynamic frame-slotted ALOHA algorithm and binary search tree algorithm, a dynamic framed binary tree (DFBT) anti-collision algorithm is presented to solve the problem of multi-tag collision in radio frequency identification (RFID). Vogt algorithm is adopted to estimate tags number, then the dynamic frame-slotted ALOHA (DFSA) algorithm is used to identify tags, and the unidentified tags are extracted and the highest collision bit is judged by readers. The highest collision tags are grouped by the collision bit within the binary search tree (BST) algorithm. Simulation results show that the DFBT algorithm can improve the identification efficiency and stability which reduces the total time slots and the cost. When the tags number is about 1000, identification efficiency of the DFBT algorithm is about 64%. Compared with the DFSA algorithm and the regressive-style binary search tree (RBST) algorithm, the proposed algorithm enhances the identification efficiency by 210% and 30% respectively.

Recommended Citation

Zhang, Xiaohong and Zhou, Weihui (2019) "Research on Dynamic Framed Binary Tree Anti-collision Algorithm for RFID System," Journal of System Simulation: Vol. 30: Iss. 3, Article 37.
DOI: 10.16182/j.issn1004731x.joss.201803037
Available at: https://dc-china-simulation.researchcommons.org/journal/vol30/iss3/37

First Page

1063

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201803037

Last Page

1073

CLC

TN911.23

Recommended Citation

Zhang Xiaohong, Zhou Weihui. Research on Dynamic Framed Binary Tree Anti-collision Algorithm for RFID System[J]. Journal of System Simulation, 2018, 30(3): 1063-1073.

DOI

10.16182/j.issn1004731x.joss.201803037