Improved binary tree anti-collision algorithm in RFID system

This paper describes the characteristics of radio frequency identification technology and its application prospects. Analysis and comparison of the deterministic algorithm in the current RFID system are done for the collision bit information after each detection. It proposes a method using binary tree structure to handle the collision bit. Through mathematical analysis and simulation, the algorithm has a great improvement in the amount of labels transmitted and the number of reader queries. To solve the problem of collisions in the RFID system it provides a new way of thinking.