# US 2012/0075075 A1 · Label anti-collision method and system > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2012/0075075 A1 - Document ID: US20120075075A1 - Status: Published application - Kind: A1 - Application number: 13/375,540 - Filed: 2009-12-28 - Published: 2012-03-29 - Earliest claimed: 2009-06-12 - Assignees: Zte Corporation - Inventors: Jiang Du; Li Wang; Yongzhi Zhang - Web page: https://patentgrep.com/patent/US20120075075A1 ## CPC - G06K 7/0008: {General problems related to the reading of electronic memory record carriers, independent of its reading method, e.g. power transfer} - G06K 7/10049: {binary tree} - G06K 7/10059: {transponder driven} - G06K: GRAPHICAL DATA READING (image or video recognition or understanding G06V); PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS ## Abstract A label anti-collision method is disclosed, which is applied in a radio frequency identification system including a reader and labels. When the labels enter into an arbitration process, the reader sends the predetermined number of labels to the labels; the reader sends start counting instruction; after a label receives the start counting instruction, the label initializes its own information, and according to the predetermined number of the labels, selects a random number as an initial value of a counter and enters into the arbitration process. A label anti-collision system is also disclosed. With the method and the system, all the labels are hashed at the beginning of arbitrating with the Binary Tree method so as to reduce the probability of the collisions and improve the arbitration efficiency. ## Claims ### Claim 1 A label anti-collision method, applied in a radio frequency identification system comprising labels and a reader, wherein, when the labels enter into an arbitration process, the method comprises: the reader sending the predetermined number of labels to the labels and further sending start counting instruction; after a label receives the start counting instruction, the label initializing its own information, according to the predetermined number of labels selecting a random number as an initial value of a counter and entering into the arbitration process. ### Claim 2 (depends on 1) The method of claim 1, wherein, before the label enters into the arbitration process, the method comprises: the reader selecting labels in an effective radio frequency field area; the reader sending select instruction, and after the labels receive the select instruction, the labels performing a condition matching, and when meeting the condition the labels entering into the arbitration process. ### Claim 3 (depends on 1) The method of claim 1, wherein, the arbitration process comprises: responding the information of the labels whose counter values are 0 to the reader; the reader receiving the information of the labels; if the reader receives a correct response information from a label or there is no response information within a stated time slot, the reader sending a success acknowledgement instruction to the label; and if the reader receives a collision error information within the stated time slot, the reader considering that a collision happens because a plurality of labels respond, and then sending failure acknowledgement instructions to the labels. ### Claim 4 (depends on 3) The method of claim 3, wherein, when the labels receive the success acknowledgement instructions, those labels whose label identifications conform to success command parameters comprising in the success acknowledgement instructions leave the arbitration process after further responding successfully; and for those labels whose label identifications do not conform to the success command parameters, the counter values of those labels are further subtracted by 1, and then the labels whose counter values are 0 further respond to the reader. ### Claim 5 (depends on 3) The method of claim 3, wherein, when the labels receive the failure acknowledgement instructions, those labels whose counter values are 0 further perform to split and a random number generator is started up, and the counter values are modified according to generated random numbers; and the labels whose counter values are not 0 further add the counter values by 1, while the labels whose counter values are 0 further respond to the reader. ### Claim 6 A label anti-collision system, comprising a reader and labels; wherein, the reader is adapted to predetermine the number of labels, send the number of the labels to the labels, and send start counting instruction; each of the labels is adapted to initialize information of the label itself after receiving the start counting instruction, select a random number as an initial value of a counter according to the predetermined number of the labels and enter into an arbitration process. ### Claim 7 (depends on 6) The system of claim 6, wherein, the system further comprises: the reader is further adapted to select labels in an effective radio frequency field area and send select instruction before the labels enter into the arbitration process; the labels are further adapted to perform a condition matching after receiving the select instruction, and the labels meeting the condition enter into the arbitration process. ### Claim 8 (depends on 6) The system of claim 6, wherein, the labels are further adapted to respond the reader with the information of the labels whose counter values are 0; the reader is further adapted to receive the information of the labels within a stated time slot; and if the reader receives a correct response information from a label or there is no response information within the stated time slot, send a success acknowledgement instruction to the label, and if the reader receives a collision error information within the stated time slot, consider that a collision happens because a plurality of labels respond, and send failure acknowledgement instructions to the labels. ### Claim 9 (depends on 8) The system of claim 8, wherein, the labels are further adapted that: when receiving the success acknowledgement instructions, those labels whose label identifications conform to success command parameters comprising in the success acknowledgement instructions leave the arbitration process after responding successfully; and for those labels whose label identification do not conform to the success command parameters, the counter values of those labels are subtracted by 1, and the labels whose counter values are 0 respond to the reader. ### Claim 10 (depends on 8) The system of claim 8, wherein, the labels are further adapted that: when the labels receive the failure acknowledgement instructions, those labels whose counter values are 0 perform to split and a random number generator is started up, and the counter values are modified according to generated random numbers; and the labels whose counter values are not 0 add the counter values by 1, while the labels whose counter values are 0 respond to the reader. ### Claim 11 (depends on 2) The method of claim 2, wherein, the arbitration process comprises: responding the information of the labels whose counter values are 0 to the reader; the reader receiving the information of the labels; if the reader receives a correct response information from a label or there is no response information within a stated time slot, the reader sending a success acknowledgement instruction to the label; and if the reader receives a collision error information within the stated time slot, the reader considering that a collision happens because a plurality of labels respond, and then sending failure acknowledgement instructions to the labels. ### Claim 12 (depends on 11) The method of claim 11, wherein, when the labels receive the success acknowledgement instructions, those labels whose label identifications conform to success command parameters comprising in the success acknowledgement instructions leave the arbitration process after further responding successfully; and for those labels whose label identifications do not conform to the success command parameters, the counter values of those labels are further subtracted by 1, and then the labels whose counter values are 0 further respond to the reader. ### Claim 13 (depends on 11) The method of claim 11, wherein, when the labels receive the failure acknowledgement instructions, those labels whose counter values are 0 further perform to split and a random number generator is started up, and the counter values are modified according to generated random numbers; and the labels whose counter values are not 0 further add the counter values by 1, while the labels whose counter values are 0 further respond to the reader. ### Claim 14 (depends on 7) The system of claim 7, wherein, the labels are further adapted to respond the reader with the information of the labels whose counter values are 0; the reader is further adapted to receive the information of the labels within a stated time slot; and if the reader receives a correct response information from a label or there is no response information within the stated time slot, send a success acknowledgement instruction to the label, and if the reader receives a collision error information within the stated time slot, consider that a collision happens because a plurality of labels respond, and send failure acknowledgement instructions to the labels. ### Claim 15 (depends on 14) The system of claim 14, wherein, the labels are further adapted that: when receiving the success acknowledgement instructions, those labels whose label identifications conform to success command parameters comprising in the success acknowledgement instructions leave the arbitration process after responding successfully; and for those labels whose label identification do not conform to the success command parameters, the counter values of those labels are subtracted by 1, and the labels whose counter values are 0 respond to the reader. ### Claim 16 (depends on 14) The system of claim 14, wherein, the labels are further adapted that: when the labels receive the failure acknowledgement instructions, those labels whose counter values are 0 perform to split and a random number generator is started up, and the counter values are modified according to generated random numbers; and the labels whose counter values are not 0 add the counter values by 1, while the labels whose counter values are 0 respond to the reader.