An Optimize Anti-Collision Algorithm for Rfid System Based on Query Tree

In order to improve the efficiency of tags identification in RFID system with a mass of tags,with analysis over e the existing algorithm with mechanism of the binary tree,this paper proposes an optimized RFID anti-collision algorithm based on query tree,aiming to reduce algorithm's search-number and transmission of data. The algorithm introduces query stack to dynamic query with memory in order to achieve fewer search-number,references array and register to store the data of non-collision slot and the number of collision slot,and optimizes query command and tags respond-information to reduce the transmission of data. Analysis and simulation results show that the number of search and the amount of data transmission of the proposed algorithm is significantly reduced compared with the elementary binary anti-collision algorithm,the average identify efficiency is close to 0.71. The performance reaches a higher level.