An efficient anti-collision algorithm through division transfer of tag ID in RFID systems

With the wide adoption of radio frequency identification (RFID) system, one of important issues is the anti-collision problem. This means that the reader should be identified all tags within the same range, efficiently, fast. Generally, the tree-based protocols should make the unique ID from the request from the reader and the response from tags. In the result, the traditional methods need the number of considerable query. In this paper, we, on the environment making IDs from the rest of bits except the specified fields of EPC Class 1 Gen. 2 for the similar circumstances that we can easily look at real environment, propose the BSCTTA based method to reduce the number of query.