This paper describes a new tree based anti-collision algorithm for Radio Frequency Identification (RFID)
systems. The proposed technique is based on fast parallel
binary splitting (FPBS) technique. It follows a new identification path through the binary tree. The main advantage
of the proposed protocol is the simple dialog between the
reader and tags. It needs only one bit tag response
followed by one bit reader reply (one-to-one bit dialog).
The one bit reader response represents the collision report
(1: collision; 0: no collision) of the tags' one bit message.
The tag achieves self transmission control by dynamically
updating its relative replying order due to the received
collision report. The proposedalgorithm minimizes the
overhead transmitted bits per one tag identification. In the
collision state, tags do modify their next replying order in
the next bit level. Performed computer simulations have
shown that the collision recovery scheme is very fast and
simple even with the successive reading process. Moreover, the proposed algorithm outperforms most of the recent techniques in most cases.