Abstract

With the development of information technology and declining in the cost of tags, radio frequency identification (RFID) system has become more and more popular, which has been widely used in a lot of areas, such as logistics tracking, animals identification, medicine, electronic toll collection, inventory, asset management, manufacturing, etc. However, when we use RFID technology to identify the objects, tag collision is one of the important factors to influence the identification efficiency. Currently, Aloha-based algorithm is one of the popular anti-collision algorithms which performs well when the number of tags is small. But it is not very efficient for cases with large number of tags and some areas which tags' number can be estimated, such as warehouse, supermarket, the production lines of smart factory and so on. So in this paper, we proposed a new anti-collision algorithm called group improved enhanced dynamic frame slotted ALOHA (GroupIEDFSA) by estimating the number of unread tags first, comparing the maximum frame size and dividing tags into groups when the number of tags which are activated is large. What is more, compared with enhanced dynamic frame slotted ALOHA (EDFSA) algorithm in the process of identification, GroupIEDFSA algorithm will combine new group based on the unread tags' number. Simulation results show that the efficiency of GroupIEDFSA algorithm system improves by 20 % in time and over 50 % in rounds than EDFSA algorithm in the standard mode, and increases by 1 % in time when we used fast mode.

Full Text
Paper version not known

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 call

Disclaimer: 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.