BINARY TREE METHOD FOR MULTI-TAG ANTI-COLLISION

A binary tree method for avoiding collision of multiple tags, comprises: during inventorying tags, a reader sending a re-splitting instruction to the tags and entering a next time slot for reception if the reader does not receive any reply information from the tags in a specified time slot and one of the following conditions is satisfied: the reader received incorrectly reply information from the tags in a former time slot, or a re-splitting instruction was sent in the former time slot; and when the tags receive the re-splitting instruction, for tags whose counter values are not 1, the counter values remaining unchanged, and tags whose counter values are 1 splitting into two subsets, counter values of tags in one of the subsets remaining unchanged, and counter values of tags in the other subset decreasing by 1, and then the tag whose counter value is 0 replying to the reader. With the technical scheme of the present invention, the inventorying flow of Binary Tree is optimized, the inventorying efficiency is improved, the inventorying time is saved, and the whole flow becomes more reasonable.