A Fast Binary Search Anti-Collision Algorithm for Multiple Tag Identification

This paper presents a fast wireless anti-collision algorithm for radiofrequency identification (RFID) systems. The proposed algorithm introduces a new kind of inquiry round to gain the request prefixes from tags. It also has the advantages of jumping and dynamic searching algorithm (JDS) and prefix-randomized query-tree protocol (PRQT). Analysis and simulation results show that the proposed algorithm needs about 1.2 iterations to identify one tag, consuming 40.0% less iterations than JDS and 47.8% less iterations than PRQT.