Collision-Slots Skipping Based Binary Tree Anti-Collision Algorithm for RFID

Collision is a crucial issue to be addressed for an efficient identification process in radio frequency identification (RFID) systems. This paper presents an efficient collision arbitration algorithm based on binary tree algorithm to improve the performance of the RFID system. In the proposed algorithm, collision-slots skipping is applied. For a collision, binary splitting is firstly applied until the leftmost node of the binary tree contains idle or a success. From the outcome from the left-hand side node, we can expect the number of tags in the right-hand nodes. If the left-hand node is a collided slot, the binary tree will skip the right-hand node as it is expected as a collision node. The simulation results show that the proposed improved binary tree algorithm outperforms the existing algorithms.