ID Prediction Algorithm for Tag Collision Arbitration in RFID System

In radio frequency identification (RFID) system, the reader needs the anti-collision algorithm for fast identifying all of the tags in the interrogation zone. This paper proposes the tree-based ID prediction algorithm (IPA) to arbitrate the tag collision. For IPA, the count-bits, which represents the number of bit ´1´s in the ID, are added to the left position of the tag ID. The reader predicts correctly ID by using count-bits, the number of collided bits and the information of the identified bits. By using IPA, the reader can identify more than one tag at once. IPA can reduce the number of the requests transmitted from the reader, thus it shortens the time of identifying all of the tags in the interrogation zone.