Suffix-based double reader tag movement RFID anti-collision method

At present, some existing tag anti-collision algorithms are used mostly in scenarios of fixed number of tags and they perform poorly in tag moving scenarios. Therefore, this paper proposes a double reader tag movement RFID anti-collision method based on suffix, and through the cloud platform based on cloud computing, the supply chain data sharing is realized. Tag moving scenarios usually use a single reader. The proposed employs double reader to expand the recognition range and also to prolong the recognition time, but there is the problem of repeated recognition. This article proposes a suffix-based bit-slot ALOHA (SBSA) algorithm, where this problem is solved and the time-slot is reduced. In view of the problem that a large number of tags entering into the recognition area of readers lead to the reduction of the recognition efficiency. This article proposes a suffix-based tag group bit-slot ALOHA (STGBSA) algorithm, tag grouping and tag estimation methods are proposed. Complexity analysis is deployed in this article, from the perspective of the tag loss ratio and identification efficiency, the performances of various anti-collision algorithms are evaluated and compared with those of the existing methods. The simulation results show that the method proposed in this paper is better than the existing methods.

An Improved RFID Tag Collision Algorithm

Tag collision is a very important research direction in the RFID system. Probabilistic solving algorithm is one of the important way to solve the tag collision, dynamic frame slot ALOHA (DFSA) algorithm is more commonly used at present and the probabilistic algorithm with better effect. This paper proposes an Advanced DFSA (ADFSA) which is based on a dynamic frame slot ALOHA algorithm, combined with multiplier factor and grouping thoughts. the algorithm is simple, at the same time, the simulation results show that IDFSA algorithm has better performance.

Research of Underground Tag's Anti-Collision Algorithm

Study of the conflict questions of multiple miners (electronic tag) in the same RF induction area of the underground personnel positioning system. Analyze the Pure Aloha algorithm, Time Slot Aloha algorithm, Dynamic Framed slotted Aloha algorithm based on Binary algorithm. And put forward a kind of mixed anti-collision algorithm through improved.

QTDFS-ALOHA

Proposed protocols work clumsily in resolving the collisions occurred in dense RFID tag environment. QTDFS-ALOHA, a hybrid protocol which combines the query tree protocol and the dynamic frame slot ALOHA protocol, is proposed. In each frame of this protocol, only tags in the active set are allowed to answer in randomly selected slots. Afterwards, the population of tags in the active set is estimated. According to the identification accuracy required, the protocol may choose to continue the identification of the active set with delicately calculated frame length, or to divide the active set into multiple subsets using some binary prefix strings and identify each subset subsequently in the following frames. This process is performed recursively for all tag sets until the required accuracy is achieved. Proposed tag population estimation methods are summarized and evaluated. Numeric simulation verifies that this hybrid protocol outperforms other frame slot ALOHA based protocols.

A Lightweight RFID Mechanism Design

Based on the study of existing RFID security protocols and RFID anti-collision algorithms, this paper proposes a processing mechanism integrating lightweight random key double-authentication and dynamic slot-ALOHA protocol. The mechanism is simple, practical, and compatible with EPC Gen2 standards. Research shows that comparing with the other security protocols and anti-collision protocols, the new mechanism has a little complexity and tag-cost.

Study on Dynamic and Estimated Algorithm for RFID Tag Anti-Collision

RFID is an important part of Internet of things, however, solving tag anti-collision problem is the key to RFID. In order to improve the identification efficiency of anti-collision algorithm, the performance of the time slot ALOHA algorithm is analyzed and the improved ALOHA is proposed that when there is an unknown number of tags, the window size will be dynamically adjusted according to the anti-collision algorithm. When estimate the number of tags, the conflict probability is taken into account and according to the current window size, the return value of each read cycle, the calculated conflict probability, and the estimated number of tags, the window size will be dynamically adjusted. The number of tags and the colliding tags within one time slot can be identified quickly and the performance of the system and tag anti-collision algorithm will be improved. Through modeling and simulation, after comparing and analyzing the results, the practicability and feasibility of the improved anti-collision algorithm is verified.