Abstract
Abstract The work aims at the problem of multi-tag collision in RFID system, then analysis the binary tree algorithm and ALOHA and points out their shortcomings, we proposed a Hybrid of ALOHA and Tree (HAMT) Algorithm. The algorithm first uses the DFSA algorithm for tag identification, and dynamically selects the multi-fork tree algorithm for tag identification based on the number of unidentified tags secondly, thus ensuring that the tag is 100% identified, and improves recognition efficiency and shortens recognition time. The results of the simulation show that when the number of tags is about 1000, the recognition efficiency of the HAMT algorithm can reach around 0.72. So the HAMT algorithm can solve the multi-tag collision problem.
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.
