Efficient Anti-collision Protocol Research Articles

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.

Comparison of energy consumption for reader anti-collision protocols in dense RFID networks

Radio-frequency identification (RFID) is known as a universal technology and has been in the center of attention in the past few years. Readers and tags constitute the main parts of an RFID system. Similar to other wireless devices, RFID readers are confronted with the critical problem of collision. This is because in some applications, numerous readers are spread out densely and are attempting to attain the same tags simultaneously. Collisions are classified to reader-to-reader and reader-to-tag collisions. Both of these collisions may decrease the system’s throughput and performance, or even result in the consumption of a considerable amount of energy. Many various anti-collision protocols have been proposed to avoid these collisions, but there are only a few researches concerning their energy efficiency. While this paper will look at the main reader anti-collision protocols, it will also demonstrate the evaluation results of their energy efficiency via experimental simulations in similar circumstances. The obtained results can help in choosing the most efficient anti-collision protocol in applications like using mobile readers or combining RFIDs with WSN networks which have energy-consuming constraints.

A General Collision Tree Protocol for RFID Tag Identification to Handle the Capture Effect in RFID System

This paper presents a simple and efficient anti-collision protocol, named General Collision Tree Protocol (GCT), that was designed to cope with the capture effect in RFID system. The goal is to ensure that all tags are completely identified including the hidden tags and missing read tags which exist in conventional anti-collision protocols because of capture effect and other uncertainty factory in RFID system. Analysis and simulation results indicate that the performance of GCT outperforms that of the other state-of-the-art general RFID tags identification anti-collision protocols. The identification efficiency of it is always above 50% no matter what the capture probability of the RFID system is.

Stability Analysis of an Efficient Anti-Collision Protocol for RFID Tag Identification

A stable and efficient anti-collision protocol is very important for tags identification in many radio frequency identification (RFID) system such as flow productions and automatic controls. In this paper, we introduce an efficient anti-collision protocol named collision tree protocol (CT) and analyze the stability of it in detail. Both theoretical results and experimental results indicate that the performance of CT is only dependent on the number of tags to be identified and not influenced by the distribution of tag IDs and other factors, and the average performance of CT for one-tag identification converges to a constant. According to the definition of the stability of an anti-collision protocol, CT is a stable anti-collision protocol for RFID tag identification. The stability proposed in this paper provides a new performance metric for evaluating the performance of different anti-collision protocols for RFID tag identification. As a stable protocol, the time delay and the power consumption for one-tag identification of CT tend to be constant. Therefore, CT can be applied to various tags identification systems and especially suited to the RFID systems in which both the time delay and the power consumption for tags (or objects) identification are required to be limited and stable.

An Efficient Anti-Collision Protocol for RFID Tag Identification

In this paper, an efficient anti-collision protocol, named collision tree protocol (CT), is proposed, and a collision tree is put forward to capture the complete communications between the reader and tags in an execution of CT. The main novelty of CT is that both the generating of prefixes and the splitting of tag group are according to the collided bit directly. Both the properties of collision tree and the results of experiments show that the proposed protocol improves the efficiency of tags identification up to 50% and achieves the best performance of the tree-based tags identification protocols.