Abstract

Tag collision is one of the critical problems in radiofrequency identification (RFID) technology which can be widely used to identify objects using tag attachment automatically. Through the transmission and reflection of wireless radiofrequency signals, noncontact identification is realized. However, when multiple tags respond to the reader simultaneously, a collision occurs, significantly degrading the identification performance of RFID systems. To tackle the tag collisions, we propose a fast hybrid strategy‐based RFID anticollision (FHS‐RAC) protocol. Based on the conventional query tree algorithm, the proposed FHS‐RAC makes full use of collision bits and the total response bits to achieve the faster tag identification. Extensive simulations and experiments verify the feasibility and effectiveness of our proposed scheme.

Highlights

  • As the development of radiofrequency identification (RFID) technology, the RFID tag has become more and more inexpensive, facilitating a wide deployment of RFID systems

  • RFID systems suffer from collisions when a reader identifies multiple tags or multiple readers contact with a tag simultaneously

  • This paper investigates the problem of tag collisions in the large RFID systems

Read more

Summary

Introduction

As the development of radiofrequency identification (RFID) technology, the RFID tag has become more and more inexpensive, facilitating a wide deployment of RFID systems. The direct adaptability of RFID to the demands of supply chains [2,3,4], object tracking and monitoring [5,6,7], traceability of patients, or the management of medication for elderly people are a number of applications that have, in recent years, increased the popularity of this technology In these broader range of RFID-enabled applications, tag identification problem [8] is one of crucial issues, which is to allow the unread tagged objects appear in the interrogation area to be identified as fast as possible. The proposed algorithm increases the number of probe forks based on the common query tree protocol, so that it can speed up the tag identification process.

Related Works
System Model and Algorithm Description
Performance Analysis and Numerical Results
Conclusion
Full Text
Paper version not known

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