A fast tag identification anti-collision algorithm for RFID systems

© 2019 John Wiley & Sons, Ltd. In this work, we propose a highly efficient binary tree-based anti-collision algorithm for radio frequency identification (RFID) tag identification. The proposed binary splitting modified dynamic tree (BS-MDT) algorithm employs a binary splitting tree to achieve accurate tag estimation and a modified dynamic tree algorithm for rapid tag identification. We mathematically evaluate the performance of the BS-MDT algorithm in terms of the system efficiency and the time system efficiency based on the ISO/IEC 18000-6 Type B standard. The derived mathematical model is validated using computer simulations. Numerical results show that the proposed BS-MDT algorithm can provide the system efficiency of 46% and time system efficiency of 74%, outperforming all other well-performed algorithms

Tag Anti-collision Algorithm for RFID Systems with Minimum Overhead Information in the Identification Process

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

Energy efficient anti-collision algorithm for the RFID networks

Energy efficiency is crucial for radio frequency identification (RFID) systems as the readers are often battery operated. The main source of the energy wastage is the collision which happens when tags access the communication medium at the same time. Thus, an efficient anti-collision protocol could minimize the energy wastage and prolong the lifetime of the RFID systems. In this regard, EPCGlobal-Class1-Generation2 (EPC-C1G2) protocol is currently being used in the commercial RFID readers to provide fast tag identification through efficient collision arbitration using the Q algorithm. However, this protocol requires a lot of control message overheads for its operation. Thus, a reinforcement learning based anti-collision protocol (RL-DFSA) is proposed to provide better time system efficiency while being energy efficient through the minimization of control message overheads. The proposed RL-DFSA was evaluated through extensive simulations and compared with the variants of EPC-Class 1 Generation 2 algorithms that are currently being used in the commercial readers. The results show conclusively that the proposed RL-DFSA performs identically to the very efficient EPC-C1G2 protocol in terms of time system efficiency but readily outperforms the compared protocol in the number of control message overhead required for the operation

A Novel and Efficient Anti-Collision Protocol for RFID Tag Identification

Radio frequency identification (RFID) is prominent technology for fast object identification and tracking. In RFID systems, reader-to-reader or tag-to-tag collisions are common. Majority of probabilistic and deterministic anti-collisions methods are inefficient in channel distribution and improving the performance. In this work, simulation annealing based anti-collision protocol is proposed where there is uniform distribution of channels among readers. In addition, preference is given to tag state parameters over fixed scheduling in order to increase the performance. The tag state parameters named energy efficiency, distance from selected reader and distance from obstacles are considered. The simulation results show that the proposed approach is an effective mechanism where there is a minimum improvement of 16.7% for 100 readers and maximum of 32.7% for 1000 readers in tag identification ratio, and a minimum improvement of 23% for 1000 readers and maximum of 75.3% for 100 readers in total successful interrogation cycles. Further, total time cycles, total IDLE cycles, total number of collisions, delay, and total number of packets sent and received are reduced compared to state of-art protocols. It is observed that the proposed simulation annealing based protocol is contiguous channels allocation algorithm with zero collision

Perfect tag identification protocol in RFID networks

Radio Frequency IDentification (RFID) systems are becoming more and more popular in the field of ubiquitous computing, in particular for objects identification. An RFID system is composed by one or more readers and a number of tags. One of the main issues in an RFID network is the fast and reliable identification of all tags in the reader range. The reader issues some queries, and tags properly answer. Then, the reader must identify the tags from such answers. This is crucial for most applications. Since the transmission medium is shared, the typical problem to be faced is a MAC-like one, i.e. to avoid or limit the number of tags transmission collisions. We propose a protocol which, under some assumptions about transmission techniques, always achieves a 100% perfomance. It is based on a proper recursive splitting of the concurrent tags sets, until all tags have been identified. The other approaches present in literature have performances of about 42% in the average at most. The counterpart is a more sophisticated hardware to be deployed in the manufacture of low cost tags.Comment: 12 pages, 1 figur

From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification

The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based Mary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost

From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification

The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based Mary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost

An effective frame breaking policy for dynamic framed slotted aloha in RFID

The tag collision problem is considered as one of the critical issues in RFID system. To further improve the identification efficiency of an UHF RFID system, a frame breaking policy is proposed with dynamic framed slotted aloha algorithm. Specifically, the reader makes effective use of idle, successful, and collision statistics during the early observation phase to recursively determine the optimal frame size. Then the collided tags in each slot will be resolved by individual frames. Simulation results show that the proposed algorithm achieves a better identification performance compared with the existing Aloha-based algorithms