Abstract
RFID is a generic term for technologies which use RF waves to identify, track, or categorize any object. One of the research areas in RFID systems is a tag anti-collision protocol; how to reduce identification time with a given number of tags in the field of an RFID reader. There are two types of tag anti-collision protocols for RFID systems: tree based algorithms and slotted aloha based algorithms. This paper proposes a method for enhancing the performance of the present RFID tag anti-collision protocols by scanning the positions of collided bits and once accessing few memories at tags to inform the positions. Since any of the present RFID tag anti-collision protocols with the scanning-based pre-processing can ignore the overhead from no collided bits, the analytic results show that scanning-based pre-processing elicits lower time consumption for tag identification from the present schemes.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
