Abstract: The method includes: a reader begins to count the tags, and waits for feedback of the tags; the tags are split into two subsets if the tags feedback the collision, the tags of one of the subsets feedback, the tags of the other subset begin to feedback when the tags of one of the subsets complete the count; when the collision occurs in the course of feedback, then the split continues until all the tags are completed the count; the tags of many branches are at least once split simultaneously when the tags of the subsets are split.

Abstract: A binary tree method for avoiding collision of multiple tags, comprising: 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 the 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 0 and 1, and those counter-0 tags replying to the reader. With the present invention, the inventorying flow of Binary Tree is optimized, the inventorying efficiency is improved, and the whole flow becomes more reasonable.

Abstract: A binary tree method for avoiding collision of multiple tags, comprising: 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 incorrect reply information from the tags in the 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 0 and 1, and those counter-0 tags replying to the reader. With the present invention, the inventorying flow of Binary Tree is optimized, the inventorying efficiency is improved, and the whole flow becomes more reasonable.

Abstract: The method includes: a reader begins to count the tags, and waits for feedback of the tags; the tags are split into two subsets if the tags feedback the collision, the tags of one of the subsets feedback, the tags of the other subset begin to feedback when the tags of one of the subsets complete the count; when the collision occurs in the course of feedback, then the split continues until all the tags are completed the count; the tags of many branches are at least once split simultaneously when the tags of the subsets are split.