Parallel binary tree splitting protocol for tag anti-collision in RFID systems

Abstract

This paper describes new tree based anti-collision algorithm for Radio Frequency Identification (RFID). The proposed algorithm is based on parallel binary splitting (PBS) technique to follow new identification path through the binary tree. The dialog between the reader and tags needs only one bit tag response followed by one bit reader reply (one-to-one bit dialog). The proposed scheme does not send restarting node position, from the tree leaves, after each tag identification. So, the number of transmitted bits is equal to twice the number of the binary tree nodes of the existing tags except the leaves nodes. Performed computer simulations have shown that the collision recovery scheme is very fast and simple. The simulation results shows that the proposed technique outperforms most of the recent techniques in most cases.