ID anti-collision method using data structure applied to RFID system

• US 20070028049A1
• Filed: 05/30/2006
• Published: 02/01/2007
• Est. Priority Date: 07/26/2005
• Status: Abandoned Application

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Kang, Woo-shik, Yang, Jin-young, Lee, Joon-goo, Kim, Seon
• Application Number:
  US11/442,534
• Publication Number:
  US 20070028049A1
• Time in Patent Office: Days
• US Class Current: 711/122
• CPC Class Codes: G06K 7/0008 General problems related to the reading of electronic memory record carriers, independent of its reading method, e.g. power transfer
• CPC Class Codes: G06K 7/10049 binary tree

Abstract

An identification (ID) anti-collision method using a data structure to be applied to a radio frequency identification (RFID) system, includes transmitting an ID transmission request command from the reader to the tags using a predetermined request value; determining whether the IDs of the tags collide with one another, based on a bit pattern transmitted from the tags; if the IDs of the tags collide, computing a next request value to be used at a next request to transmit a request command, and if the IDs of the tags do not collide, computing and storing a future request value to be used; and if the IDs of the tags do not collide, transmitting and receiving data and a tag using an ID of the tag corresponding to the bit pattern and if the requested value is stored, transmitting a request command using the stored request value.

Claims

1. An identification (ID) anti-collision method for a radio frequency identification (RFID) system including a reader having a data structure and a plurality of tags having IDs, the ID anti-collision method comprising:

(a) transmitting an ID transmission request command from the reader to the tags using a request value;

(b) determining whether the IDs collide with one another based on a bit pattern transmitted from the tags;

(c) if the IDs of the tags collide with one another, computing a next request value for a next request based on the bit pattern to transmit a request command, and computing and storing a future request value; and

(d) if the IDs of the tags do not collide with one another, transmitting and receiving data and a tag using an ID of the tag corresponding to the bit pattern, and if the request value is stored, transmitting the request command using the future request value that was previously stored.

2. The ID anti-collision method of claim 1, wherein the future request value is stored in a data structure using an LIFO (Last Input First Out) method.

3. The method of claim 2, wherein a data structure corresponding to the LIFO method is a stack.

4. The method of claim 3, wherein a size S of the stack is equal to log₂M and M is a maximum value of a tag to be identified.

5. The ID anti-collision method of claim 1, wherein (d) comprises:

transmitting and receiving the data with respect to the tag using the ID of the tag corresponding to the transmitted bit pattern;

transmitting a mute command to the tag so that the tag does not respond to the request command;

determining whether the future request value was previously stored; and

if the future request value was previously stored, transmitting the request command using the stored future request value, and if the future request value is not stored, ending transmitting of the request command.

6. The ID anti-collision method of claim 1, wherein if the IDs of the tags are smaller than or equal to the request value of the request command, the tags respond to the request command.

7. The ID anti-collision method of claim 6, wherein the next request value is computed by determining a starting position of a bit of the bit pattern in which a collision occurs as “

0,”

a bit before the starting position as a bit value of the bit pattern, and a bit after the starting position as “

1.”

8. The ID anti-collision method of claim 6, wherein the future request value is computed by determining all bits of the bit pattern in which collisions occur as “

1” and

bits of the bit pattern in which collisions do not occur as a bit value of the bit pattern.

9. A computer-readable medium for storing a program for identification (ID) anti-collision for a radio frequency identification (RFID) system including a reader having a data structure and a plurality of tags having IDs, the program comprising:

(a) transmitting an ID transmission request command from the reader to the tags using a request value;

(b) determining whether the IDs collide with one another based on a bit pattern transmitted from the tags;

(c) if the IDs of the tags collide with one another, computing a next request value for a next request based on the bit pattern to transmit a request command, and computing and storing a future request value; and

(d) if the IDs of the tags do not collide with one another, transmitting and receiving data and a tag using an ID of the tag corresponding to the bit pattern, and if the request value is stored, transmitting the request command using the future request value that was previously stored.

10. The computer-readable medium of claim 9, wherein the future request value is stored in a data structure using an LIFO (Last Input First Out) method.

11. The computer-readable medium of claim 10, wherein a data structure corresponding to the LIFO method is a stack.

12. The computer-readable medium of claim 11, wherein a size S of the stack is equal to log₂M and M is a maximum value of a tag to be identified.

13. The computer-readable medium of claim 9, wherein the operation (d) comprises:

transmitting and receiving the data with respect to the tag using the ID of the tag corresponding to the transmitted bit pattern;

transmitting a mute command to the tag so that the tag does not respond to the request command;

determining whether the future request value was previously stored; and

if the future request value was previously stored, transmitting the request command using the stored future request value, and if the future request value is not stored, ending transmitting of the request command.

14. The computer-readable medium of claim 9, wherein if the IDs of the tags are smaller than or equal to the request value of the request command, the tags respond to the request command.

15. The computer-readable medium of claim 14, wherein the next request value is computed by determining a starting position of a bit of the bit pattern in which a collision occurs as “

0,”

a bit before the starting position as a bit value of the bit pattern, and a bit after the starting position as “

1.”

16. The computer-readable medium of claim 14, wherein the future request value is computed by determining all bits of the bit pattern in which collisions occur as “

1” and

bits of the bit pattern in which collisions do not occur as a bit value of the bit pattern.