Abstract:

In order to overcome the shortcomings of binary anti-collision,such as more communication data and communication time,a novel dynamic binary anticollision algorithm is proposed.In the new algorithm,the ID information is preprocessed in the first communication between the reader and tags,and then only the collision bits are handled in the next process.The binarytree is constructed by the deleted collision bits accordingly.The bits before the highest collision bit followed by "0"  constitute the left subtree.The bits before the highest collision bit followed by "1" and the bits between the highest collision bit and the second highest one constitute the right subtree. Then the tags are identified at leaf level.The new algorithm is improved for both reader and tags, so that it reduces the amount of communication data and improves the recognition efficiency.

Key words: information preprocessing;anti-collision;binary-tree;radio frequency identification