Abstract
In order to solve the problem of RFID tags collision in the current logistics system. Based on the study of existing anti-collision algorithms, a grouped dynamic frame slot with query tree (GDQT) algorithm was designed for a large number of labeling scenarios in logistics management. The GDQT algorithm first estimates the number of tags that have not been identified after each round of identification by the tag estimation algorithm, if less than or equal to 354, the tags were first identified using the dynamic frame slot ALOHA (DFSA) algorithm., and then using the query tree algorithm (QT) for the remaining tags identification. If the number of unrecognized tags was greater than 354, the tags should be first grouped, and then DFSA and QT would be used for tags identification. The simulation results showed that GDQT algorithm can improve system throughput rate and keep throughput rate at around 0.82, which is 300%, 120%, 50% higher than the DFSA algorithm, GDFSA algorithm and AHT algorithm respectively. Therefore, The GDQT algorithm has a good application prospect in the logistics system.
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.
