TWO-STAGE QUERY TREE SCHEME IN RFID SYSTEM

摘要

The present invention relates to an identification algorithm in an RFID system based on a query tree. The purpose of the present invention is to prevent waste of a data transmission amount caused as a reader in an RFID system always receives all bits of a tag ID when receiving a response signal from a tag. According to the present invention, to achieve the purpose, an identification step of a tag is divided into two stages so that only 16 bits which are a part of the total 96 bits of an EPC type tag are identified in the first stage and then all the 96 bits are identified in the second stage by using a tag ID of 16 bits as a signal. At this time, the reader identifies a tag by using a collision tracking algorithm in each stage. In this process, the reader identifies the tag in a reverse order from a serial number having different values for all tags. According to the present invention, it is expected that a time for identifying a tag is reduced by using a protocol for identifying a tag by two divided stages.;COPYRIGHT KIPO 2018