An Improved Binary Query Tree Algorithm for Tags Anti-collision in RFID

In the RFID systems,tags anti-collision technology which can solve the tags collision problem resulting from the data transaction between the reader and multiple tags at the same time,is one of the key technologies to improve efficiency of tags identification.An improved query tree tags anti-collision algorithm is put forward on the basis of analyzing the traditional binary query tree algorithm-dynamic binary query tree algorithm.Manchester code is used in the process for tags responding to detect collision effectively,so that the new algorithm can dynamically change the query prefix,which makes the reader greatly reduces both query frequency and data iteration,and also improves the identification efficiency.The simulation results show that in the case of very large number of tags the improved algorithm is more effective and steady than traditional binary query tree algorithm.