Research on improved binary anti-collision algorithm
一种改进二进制防碰撞算法研究*

To conquer the shortcomings of general binary anti-collision algorithms,such as more interactive times and communication data,proposed an improved binary anti-collision algorithm.When tags were identified the IDs information firstly and then in the whole process only the collision bits were dealt with.It constructed the identification tree from tags leaves and could identified the tags directly on leaves’father level.No matter whether the tags’ collision bits were consecutive or not,the algorithm was always effective.On interactive times,communication data and identification efficiency,the new algorithm had obvious superiority,especially when there were many tags within the scope of reader and collision bits were less than the length of tags.The algorithm is proved feasible,practical and effective by simulation,theory analysis and testing instance.