Influence of the Distribution of Tag IDs on RFID Memoryless Anti-Collision Protocols

Abstract

In recent years, Radio Frequency Identification (RFID) has become very popular. The main feature of this technology is that RFID tags do not require close handling and no line of sight is required between the reader and the tags. RFID is a technology that uses radio frequencies in order to identify tags, which do not need to be positioned accurately relative to the reader. Tags share the communication channel, increasing the likelihood of causing a problem, viz., a message collision. Tree based protocols can resolve these collisions, but require a uniform tag ID distribution. This means they are very dependent of the distribution of the IDs of the tags. Tag IDs are written in the tag and contain a predefined bit string of data. A study of the influence of the tag ID distribution on the protocols’ behaviour is proposed here. A new protocol, called the Flexible Query window Tree (FQwT) is presented to estimate the tag ID distribution, taking into consideration the type of distribution. The aim is to create a flexible anti-collision protocol in order to identify a set of tags that constitute an ID distribution. As a result, the reader classifies tags into groups determined by using a distribution estimator. Simulations show that the FQwT protocol contributes to significant reductions in identification time and energy consumption regardless of the type of ID distribution.

Improving Efficiency of Passive RFID Tag Anti-Collision Protocol Using Dynamic Frame Adjustment and Optimal Splitting

“…In RFID, two major concerns are emphasized: RFID tag collisions and RFID missing-tag events. The first issue requires that the emphasis be placed on reducing the number of collisions while the second one on scanning a group of known tags and identifying missing tags in the current round [ 21 , 22 ]. When the number of tags is equal to the number of slots in the initial frame, BTSA achieves the highest efficiency value of 0.43 [ 23 ], which is greater than the pure binary tree protocol [ 24 ] and the dynamic frame slotted ALOHA (Dynamic FSA) [ 12 ] with the same efficiency as the tree slotted ALOHA protocol (TSA) [ 18 , 25 ].…”

Quality Assessment of Real-Time Location, Time and Temperature Data Generated by Active Radio Frequency Identification (RFID) Technology in Hospital Settings

“…In comparison to other current identification technologies, RFID seems to be the most promising. For instance, barcodes on medical products have the disadvantage that they require active user interaction and that they must be read in a straight line [9]. Moreover, multiple barcodes on products, including those codes containing irrelevant information from previous steps in the process, might generate incorrect information when the wrong barcode is being scanned further in the process [10].…”

RFID Anti-Collision Detection Algorithm Based on Improved Adaptive N-Tree

“…Currently, the anti-collision algorithms of RFID system mainly include: (1) Alohabased anti-collision algorithm which suppresses information collision by randomly extending the start time of information transmission [7][8][9] (2) Tree-based anticollision algorithms which subdivides the tags where the information collisions occur into a number of subsets for unique identification [10][11][12][13][14] (3) A Aloha-and tree-based superposition hybrid algorithm [15][16][17][18][19][20][21]; The above three algorithms all have limitations in different degrees.…”