An Efficient and Reliable Tree-based Anti-collision Protocol for RFID Systems with Capture Effect

In radio frequency identification (RFID) systems, if tags transmit their IDs simultaneously, a reader cannot correctly identify the IDs due to collision and the performance of RFID systems degrades by the collision. So, anti-collision protocols to reduce the number of collisions are required. The binary tree anti-collision protocol branches randomly in a tree to reduce collisions in the next identification process when the IDs are not identified after sending the IDs of tags. The channel condition may change due to the distance between a reader and a tag, noise or interference from he IDs of tags in the binary tree protocol. When a tag is identified by the capture effect, the tags in the same slot may lose the opportunity for identification. Thus, we propose an efficient and reliable binary tree-based anti-collision protocol considering channel errors and the capture effect. We derive the total time slots of the proposed protocol analytically and show the performance of RFID systems for the proposed protocol through simulations. Keywords—Radio frequency identification (RFID), anticollision, channel error, capture effect