Abstract
This paper proposes a fast query tree-based (FQT) algorithm for anti-collision in RFID system. Tags to be identified would be grouped by a reader randomly at beginning, and the reader identifies a group of tags and records the quantity of tags. Then reckons the number of all tags and carries out optimized group again. In identification process, the prefix of queries would add two bits in odd rounds, and one bit in even rounds. The results of analysis and simulation show that FQT algorithm can obtain the better performance than QT algorithm.
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.
