A Binary Tree Search Anti-collision Algorithm Basing Intelligent Tag

As the new wave of global information industry revolution led by Internet of things(IOT) is continuously urged, RFID(radio frequency identification) technology has become the core driving force to achievs globalization of manufacture,trade and logistics.Nowadays,RFID technology has been made universal in every area around our daily lives and the productions.How to improve the ability of anti-collisions to reduce the total time of identification has become the key point for the solution.In this paper,we present a binary tree search anti-collision algorithm basing intelligent tag(TBTS).It is an optimized algorithm based upon the dynamic binary tree search anti-collision algorithm(DBTS),which is compatible with the widely used ISO/IEC 14443 protocol.According to our simulation results in the typical environment with 50 tags,the total identification time of the optimized TBTS anti-collision algorithm is reduced by nearly 50%compared to DBTS anti-collision algorithm.Moreover,with the increasing number of tags,TBTS anti-collision algorithm,which implements the reduction of algorithm complexity,has higher performance and less identifying time than DBTS anti-collision algorithm.It has been applied to the RFID smart card designed by ourselves and successfully verified on the simulation platform for smart card chips.The final test report shows that,the smart card chip using the optimized TBTS anti-collision algorithm makes a more wonderful performance than the simple tag chip using DBTS anti-collision algorithm.