New Perspective on RFID Tag Anti-collision Methods: Algorithm for Dynamic Arrival Scenarios
The anti-collision algorithm for radio-frequency identification (RFID) tags is a leading technique that influences RFID systems’ quality. When tags show up in the reader’s interrogation zone in dynamic entrance situations, they cannot immediately take part in the ongoing detection, likely to result in a longer waiting period and tag overlook. A fast RFID tag anti-collision method for dynamic arrival scenarios is proposed in recent research, and it is named “DAS-DFSA algorithm,” which is based on blocking technology, dynamic frame-slotted ALOHA (DFSA) algorithm, and lastly, the first-come-first-serve (FCFS) concept.
What are the current issues?
The reader in an RFID system has a particular interrogation zone. The tag can react to the reader’s commands once it joins the interrogation zone. A tag miss incident happens when it exits the reader’s interrogation zone and is not identified, resulting in lower inventory counts than the exact total.
At the same time, the wireless channel enables two-way communication between the reader and the tag. All tags inside the interrogation zone can obtain the reader’s instructions and decide whether or not to respond based on its state guidelines. Evidently, not all of your instructions would be fulfilled.
The proposed model
Tree-based and ALOHA-based RFID tag anti-collision techniques are the two most common types. When the quantity of tags is sizable, tree-based algorithms are less effective, and the waiting period is too long when particularly in comparison to the ALOHA-based algorithm. On the other hand, ALOHA-based algorithms are probabilistic and designate several slots to tags randomly selected to transmit information. For its simplicity and efficiency, the frame-slot ALOHA (FSA) algorithm is favored. During the identification, it uses a fixed frame length. Because the frame length cannot be changed in real-time, the system’s efficiency tends to decrease once collisions occur frequently. The dynamic frame-slotted ALOHA (DFSA) algorithm was suggested to resolve the deficiencies of the FSA algorithm.
The DAS-DFSA algorithm is devoted to solving tag anti-collision and aims to promote fast identification in dynamic arrival scenarios. It is predicated on DFSA and blocking technology algorithms. The key premise is that at the end of each frame, the next frame’s arrival rate can indeed be computed, and the next frame’s ideal frame length will be determined in combination with the estimated number of undisclosed tags. The blocking method is used to divide the next frame’s slot into queuing slots and arrival slots, then into two separate waiting processes for verification and arrival detection.
What is achieved with this model?
- The new arrival tag can take part in the ongoing frame’s identification by optimizing the guidance structure and identification process, reducing the tag’s waiting period.
- Each frame identifying phase is split into a waiting process and an arrival process utilizing blocking technology to avoid collisions between new arrival tags and already waiting tags and enhance system efficiency.
- Furthermore, by using unequal-length slots, the interaction time operational costs are reduced even more, and the speed of identification is improved significantly.
- Compared to other similar methodologies, simulations showed that the average waiting period of the DAS-DFSA algorithm is lowered by more than 44.548 percent and the authentication speed is enhanced by at least 39.053 percent under the same operational conditions.
- Finally, the suggested DAS-DFSA algorithm can quickly identify tags in both stable and random arrival scenarios in dynamic arrival scenarios.
