Anti-collision algorithm based on the regressive-style RFID of BIBD (4,2,1)

This paper discusses the anti-collision algorithm that can simultaneously identify multiple tags in the RFID system, and analyses the characteristics of two types of anti-collision algorithm: BIBD (4,2,1) and the binary tree. Then we advance a novel and fast anti-collision algorithm based on the regressive-style RFID of BIBD (4,2,1). Not only does this anti-collision algorithm methodology have the advantages of BIBD algorithm, but it can also significantly reduce the query time. In this algorithm, segment the labels, and each contains only a subset of BIBD (4,2,1). It will quickly identify tags through return and by-section reading. The results of mathematical analysis and simulating show that the recognition speed of this algorithm is superior to the binary algorithm and dynamic binary algorithm, and it is applicable to the identifying situations of multiple tags and longer UID.