Abstract
A new tags anti-collision algorithm was proposed for the reader collision problems in the Radio Frequency IDentification(RFID) technology.It divided tags into groups based on the coset partition theory,and restricted each group to response in a fixed timeslot.According to the query codes and collision flag bits,the reader could identify a group of tags in one slot.The Matlab simulation results show that,compared with the binary search algorithm and dynamic frame timeslot algorithm,the proposed algorithm improves the slot utilization and throughput when the number of tags is large.
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.
