A Highly Efficient Predetection-Based Anticollision Mechanism for Radio-Frequency Identification

Abstract

One of the research areas in radio-frequency identification (RFID) systems is the reduction of the identification processing time for a number of tags within an RFID reader recognition region. In the last decade, many research results regarding anticollision algorithms have been presented in the literature. Most of them are tree-based protocols. However, it is important for tree-based protocols to enhance stability and system throughput, since they may face long identification delays when the network density is high. In this study, we present a highly efficient predetection tree-based algorithm to achieve more efficient tag identification performance. Our proposed mechanism can effectively reduce both collisions and idle cycles by exploiting the predetection technique and adjustable slot size mechanism. The simulation results show that the proposed mechanism can effectively improve tag identification time performance by around 29.9% to 64.8% over previous techniques. Further, the number of query cycles, number of collisions, and total number of slots are reduced compared to previous predetection-based protocols. It is also observed that the proposed scheme can have good performance in large-scale RFID systems.

Hybrid Predetection Technique for Efficient Tag Identification in Radio-frequency Identification Systems

“…As a result, the previously proposed predetection-based scheme outperforms many other tree-based schemes, such as the HQT and H 2 QT protocols. (21) However, some collisions that cannot be detected existed in our previous scheme.…”

“…Anticollision protocols may be classified into Aloha-based and tree-based protocols. (12)(13)(14)(15)(16)(17)(18)(19)(20)(21) Although the probability of tag collisions is lower in Aloha-based protocols, they incur the tag starvation problem, which means that a particular tag may remain unidentified for a long time. (12)(13)(14) By contrast, treebased protocols, such as the binary tree splitting protocol and query tree algorithm, ensure the identification of all tags.…”

“…(12)(13)(14) By contrast, treebased protocols, such as the binary tree splitting protocol and query tree algorithm, ensure the identification of all tags. (15)(16)(17)(18)(19)(20)(21) However, they have a relatively long identification delay. In this study, we adopted tree-based protocols with the aim of reducing the identification delay.…”

“…In our previous studies, we have addressed the main design issue in the use of a predetectionbased mechanism to reduce unnecessary idle slots and avoid collision slots. (17,21) In a predetection-based protocol, the reader allocates certain small timeslots for tags to respond to when determining the tag ID distribution. Once the tag ID distribution has been determined, only existing tags can respond in the corresponding timeslots during the following tag response cycle.…”