Improved binary query tree algorithm for anti-collision of RFID tags

In the RFID system,the anti-collision algorithm is used to avoid the data collision resulting from the data transaction between the reader and multiple tags at the same time.In this paper,the binary tree based algorithm is analyzed in detail,and a new anti-collision algorithm is put forward.The new algorithm adopts the binary slotted query tree algorithm,which largely reduces both query frequency and data iteration,and also improves identification efficiency.According to the simulation results,the new algorithm has more obvious advantages than the binary query tree algorithm.