A Review of Deterministic Anti-Collision Algorithm of Passive RFID Systems
Keywords:
RFID, Passive Tag, Anti-Collision Algorithm, Query Tree, Binary Search, Collision Tracking, Binary Tree SplittingAbstract
Radio frequency identification (RFID) are used widely in many industries, manufacturing companies, material flow systems, etc. Collisions are divided into reader collisions and tag collisions. When the reader sends out a signal which supplies power and instructions to a tag, the tag transmits its ID to the reader and the reader link to an external database with the received ID recognizes the object. The tag collisions occur in the situation when more than one tag reflects their data at the same time, which make it difficult for the reader to search and identify all tags in interrogation zone. In Passive RFID system, tags’ collision are the main issue of multi-tag identification. A various anti-collision techniques and mechanism had been researched for a better collision resolution hence improving system efficiency. Researchers had proposed and improved deterministic and probabilistic of TDMA based anti-collision algorithm. However the complexity of the algorithm is the issue in implementation for passive RFID systems. Limitation of the power and the computational capability of the tags are the constraint of passive RFID system in implementing the anti-collision algorithm. This paper provides a reviews of anti-collision algorithm, an insight of collision resolution techniques, a tag and a reader specification of deterministic algorithm of passive RFID systems. These can give an overview of anti-collision algorithm with system complexity tolerance.