Research & Industrial Cooperation Group

Dongwook Lee

Ji Hwan Choi

Hyuckjae Lee

Jungeun Kim

Hyoungsuk Jeon

Hoiyoon Jung

Hyunseok Lee

Youngwoo Youn

A bi-slot tree based tag identification method in RFID systems includes (a) transmitting an inquiry of (n&#x2212;1) bits to each tag at the reader; (b) deciding whether the inquiry of (n&#x2212;1) bits are identical with first (n&#x2212;1) bits of each tag ID when receiving the inquiry of (n&#x2212;1) bits at each tag within a readable range of the reader; (c) transmitting each tag ID by one bit from (n+1)bit to last bit thereof to the reader through different time slots based on nbit value of each tag ID at the tags whose first (n&#x2212;1) bits are identical with the inquiry of (n&#x2212;1) bits; and (d) at the reader, checking whether there is a collision among the tag IDs received from the tags and identifying each tag ID of the tags based on the check result.

Bi-slot tree based tag identification method in RFID systems

A query tree based tag identification method in RFID systems includes: (a) forming a temporary ID for each of the tags; (b) comparing an inquiry of the reader with a portion of the temporary ID in each tag when receiving the inquiry from the reader; (c) if the inquiry and the portion of the temporary ID are identical to each other, transmitting a remainder of the temporary ID in each tag to the reader; (d) if a collision occurs in the step (c), generating new inquiries for storing them in the reader; (e) if there is no collision in the step (c), transmitting an ACK signal to each tag whose temporary ID is identified to receive its real tag ID therefrom; and (f) repeating the steps (b) to (e) until there is no inquiry in the reader.

Query tree based tag identification method in RFID systems

Growing community of inventors

Gyeongsangbuk-do, South Korea

Dongwook Lee