Bi-slotted tree based anti-collision protocols for fast tag identification in rfid systems

Tag identification of the two slots of the tree based on the RFID system according to the present invention, the reader; and the tag present in the reading range of the reader for transmitting an inquiry of n-1 bits for the tag to the n- receiving a query of one bit, and to receive the query and comprising the steps of: determining whether the tag earlier n-1 bits match the ID, the result of the determination, that the matching tags at different times according to the n-th bit value of the tag ID above and the tag ID of the from (n + 1) th by slot to the last bit stage to the transmission to the reader, to the reader, the last bits from the tag with each other from the said n + 1-th receiving in different time slots checking whether collision by using the tag ID, and on the basis of the check result and a step of recognizing the tag ID of the tag. Thus, the present invention reduces the quality of the reader without any burden on the tag response query between tag and reader-only can reduce response times, but also can improve the perceived performance of the tag. Anti-collision protocol, the collision bit, tri-