Label anti-collision method for radio frequency recognition system

Abstract

The invention provides a tag anti-collision method of a radio frequency identification system. A reader begins to count tags, and waits replies from the tags; all the tags begin to reply; if the tags reply success, counting of the tag is finished, if the tags reply collision, the tags are split into two subsets, namely, left branch tags and right branch tags, the left branch tags reply the reader, the right branch tags reply only after the left branch tags are counted; if the left branch tags reply success, the counting of left branch tags is finished, the right branch tags are counted, if the tags reply collision, the left branch tags are re-split to obtain new left branch tags and new right branch tags, the new left branch tags reply the reader, and the new right branch tags reply only after the new left branch tags are counted; the steps are repeated till all the tags are counted. The method is characterized in that a plurality of branch tags are obtained in at least one splitting during the tag splitting process.

Description

technical field [0001] The invention relates to the field of wireless communication, in particular to a tag anti-collision method in the field of radio frequency identification (RFID). Background technique [0002] In the actual application of RFID, in many cases, one reader corresponds to multiple electronic tags in the radio frequency field. When the reader counts multiple electronic tags at the same time, there will be channel contention and collision, and the electronic tags cannot send the information to the reader correctly. Therefore, certain mechanisms need to be adopted to avoid collisions or reduce collisions. [0003] In the existing RFID international standard ISO 18000-6, Type A and Type C use the slotted ALOHA algorithm, while Type B uses the Binary Tree (binary tree) algorithm to solve the collision problem. Both slotted ALOHA and Binary Tree are based on time division multiple access. [0004] The slotted ALOHA algorithm divides time into several discrete ...

AI Technical Summary

Problems solved by technology

In this way, after the 0 branch inventory is completed, the subsequent branch will waste a lot of time performing a split process similar to the 0 branch

Images