Abstract
Several dynamic frame-slotted ALOHA (DFSA) methods are suggested to resolve the collision problem in radio frequency identification systems. This paper proposes a rapid DFSA-based algorithm for tags identification. The above-stated algorithm is based on adaptive class parting technique to select the optimal frames length. The selection of the best frame length is a major research factor to be used for dynamic frame slotted ALOHA algorithm. To get the best frame length in DFSA protocol, we classified the tags into the some groups. Each group of tags is determined by same prefixes. The main objectives of the new algorithm are to improve the tags identification time and to increase the reader energy efficiency. The ideal frame size has to be fixed to 2 times of the total of tags bit length if the ratio among collision-slot and empty-slot is 5. Observing the results clarifies that the algorithm in this paper offers a reading rapidity of up to 400 tags/s and can achieve time-saving identification up to 15–20% in comparison to the traditional DFSA. The rapid DFSA anti-collision algorithm has a number of merits such as compatibility with ISO 18000-6, better system performance and ease of implementation.
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.
