TAG IDENTIFICATION METHOD, TAG ANTICOLLISION METHOD, RFID TAG

• US 20100182128A1
• Filed: 10/16/2008
• Published: 07/22/2010
• Est. Priority Date: 01/04/2008
• Status: Abandoned Application

• Current Assignee: Industry-University Cooperation Foundation Hanyang University
• Original Assignee: Industry-University Cooperation Foundation Hanyang University
• Inventors: Shin, Jae-Dong, Kim, Sung Kwon, Cho, Jung Sik
• Application Number:
  US12/443,207
• Publication Number:
  US 20100182128A1
• Time in Patent Office: Days
• US Class Current: 340/10.200
• 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
• CPC Class Codes: H04W 74/0841 with collision treatment

Abstract

Provided is a tag identification method in an RFID system. A tag identification method generates a query tree according to a query and a response between an RFID reader and a tag to identify the tag. In the method, a query message is transmitted from the RFID reader to the tag. A response message for the query message is received from the tag. Herein, the query tree is generated in the reverse order of a string owned by the tag. The query tree is generated in the reverse order of the tag IDs in the query tree-based protocol to reduce the frequency of collisions between the tags, thereby making it possible to reduce the time taken to identify all the tags within the recognizable range of the RFID reader.

Claims

1. A tag identification method for generating a query tree according to a query and a response between an RFID reader and a tag to identify the tag, the tag identification method comprising:

transmitting a query message from the RFID reader to the tag; and

receiving a response message for the query message from the tag,

wherein the query tree is generated in the reverse order of a string owned by the tag.

2. The tag identification method of claim 1, wherein the query message is a suffix of the string.

3. The tag identification method of claim 2, wherein if there is a collision between the response message and a response message from another tag, the RFID reader generates a string, which is obtained by attaching an additional character to the suffix, in a queue.

4. The tag identification method of claim 1, wherein the tag compares the query message with the string in the order of from the least significant bit to the most significant bit of the string to transmit the response message.

5. The tag identification method of claim 1, wherein the tag generates a reversed ID for the ID of the tag to make a comparison with the query message.

6. A tag anti-collision method comprising:

receiving a first suffix from an RFID reader;

transmitting a first response message after comparison of the first suffix with a tag ID in reverse order;

receiving a second suffix longer than the first suffix after transmission of the first response message; and

transmitting a second response message after comparison of the second suffix with the tag ID in reverse order.

7. The tag anti-collision method of claim 6, wherein the first suffix is a string of the least significant bit (LSB) to the m^th bit of the tag ID;

the second suffix is a string of the least significant bit (LSB) to the n^th bit of the tag ID;

‘

n’

is greater than ‘

m’

; and

‘

n’ and

‘

m’

are integers greater than 0.

8. An RFID tag comprising:

a demodulator unit demodulating a query message received from an RFID reader;

a controller unit comparing a string contained in the query message with a tag ID in reverse order and generating a response message if the string is equal to the tag ID; and

a modulator unit modulating the response message prior to transmission.

9. The RFID tag of claim 8, wherein the response message is the tag ID.