BINARY TREE METHOD FOR MULTI-TAG ANTI-COLLISION

摘要

A multi-tag anti-collision method using binary tree for radio frequency identification, includes: during inventory of the tags, the reader sends a re-splitting instruction to the tags if the reader has not received revert information from tags at a set time slot and if the reader has in addition either received tags information incorrectly at a last time slot or has sent a re-splitting instruction at last time slot. When the tags receive the re-splitting instruction, counters of tags with a count not equal to 1 keep their count, while tags with a count of 1 are divided into two subsets, with tags in one subset keeping their count and tags in the other subset decreasing their count by 1, and then the tags with the count of 0 answering the reader. The method enhances the binary tree method for tags inventory, improves the efficiency of the inventory, economizes time and makes the entire process more rational.