Tag Anti-collision Algorithm for RFID Systems with Minimum Overhead Information in the Identification Process
Alternative metrics PlumXhttp://hdl.handle.net/11012/56799
MetadataShow full item record
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 (0: collision; 1: 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 proposed algorithm 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.
Document typePeer reviewed
Document versionFinal PDF
SourceRadioengineering. 2011, vol. 20, č. 1, s. 61-68. ISSN 1210-2512
- 2011/1