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.
An important challenge in radio frequency identification (RFID) systems is the collision concern. When an interrogator send a request, it has several tags to answer to in its transmission range, and a tag collision has occurred. The interrogator must be able to recognize tags as rapidly as possible. A collision problem is a powerconsuming occurrence that diminishes the operation of RFID structure. This article proposes a tag anti-collision power-clustering RFID algorithm for all tag identification. The tags are boundaries into the several power level clusters based on distances of the reader. Specifically, in the proposed algorithm, tags and readers use of balanced incomplete blocks design (BIBD) to reach a fast identification. In a BIBD matrix, any two columns intersect exactly in one component that makes it possible for easy transmission of any two tags via the tag's identification in their read cycles. The aim of this article is to propose a joint organization that while decreases power consumption increases the working lifetime of RFID structure. The reader can get each tag ID by distinguishing each unit of BIBD symbols, one by one. The use of proposed algorithm brings about a great improvement in the power consumption and identification time. K E Y W O R D S algorithm, collision, power consumption, RFID
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.