METHOD FOR TAG IDENTIFICATION TAG BASED BI-SLOT TREE

摘要

A bi-slot tree-based tag identification method in an RF(Radio Frequency) system is provided to reduce a query-response frequency between a tag and a reader, and improve identification performance of the tag by reducing the number of queries of the reader without offering any burden to tag response. The reader transmits the 'n-1' bits query to the tags(S202). The tags present in coverage of the reader receive the query and check whether 'n-1' bits of the received query are matched with 'n-1' bits of a tag ID(S204). The tags having matched 'n-1' bits transmit the tag ID from 'n+1' bit to the last bit to the reader by using a different time slot according to 'n' th bit value of the tag ID(S208). The reader checks collision by using the received tag ID and identifies the tag ID of the tags based on a check result(S214).