Anti-collision algorithm based on counting mechanism and multi-state binary

RFID has become a key technology with the development of the Internet of Thing, its development and application is limited by the tag anti-collision technology which has become an urgent problem needs to be solved. In this paper, the binary search algorithm and multi-state binary search algorithm are compared and analyzed in detail, and an anti-collision algorithm based on counting mechanism and multi-state binary(CMS) is proposed. By utilizing the obtained collision information collected from preprocessing, the supreme conflict counting mechanism is introduced into the multi-state binary search algorithm. Theoretical analysis and simulation results show that the proposed algorithm can greatly reduce the query search times, the length of reader's send command and tag's response command as well as the identification time.