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.
Highlights
Radio-frequency identification (RFID) is an automatic technology that is widely used in modern industrial practical applications, such as inventory management [1], object identification and tracking, supply-chain management, and wireless sensor networks [2,3]
In a preliminary work [22], we addressed the key design aspect of using a predetection-based technique called the Pre-Detection Broadcasting Query Tree (PDBQT) protocol, to eliminate those unnecessary idle cycles and avoid collision cycles
Number of Queries vs. Number of Tags. This experiment evaluates the effect that the number of tags has on the performance of number of queries needed by the reader to complete the tag identification of the H2QT, PDBQT, Efficient Pre-Detection–based Query Tree (EPDQT)-2, EPDQT-3, and EPDQT-4 approaches
Summary
Radio-frequency identification (RFID) is an automatic technology that is widely used in modern industrial practical applications, such as inventory management [1], object identification and tracking, supply-chain management, and wireless sensor networks [2,3]. Myung et al [13] proposed the adaptive memoryless tag anticollision protocol, which is an extended scheme based on the query tree protocol The reader in this proposed approach uses a queue to maintain prefixes, and an additional candidate queue for maintaining both prefixes of identified nodes and no-response nodes of the last identification process. Yan et al [26] proposed a hybrid anticollision algorithm, called anticollision protocol based on improved collision detection, to reduce tag collisions Their approach employs the idea of bit-tracking technology and dual-prefix matching into a collision arbitration mechanism in the RFID system. In a preliminary work [22], we addressed the key design aspect of using a predetection-based technique called the Pre-Detection Broadcasting Query Tree (PDBQT) protocol, to eliminate those unnecessary idle cycles and avoid collision cycles.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
