Performance Analysis of Anti-Collision Protocols for RFID Systems

Abstract

Recently RFID technology has made its way into end-user applications, enabling automatic item identification without requiring line of sight. In particular passive tags provide a promising, low cost and energy-efficient solution for inventory applications. However, their large-scale adoption strictly depends on the efficiency of the identification process. A major challenge is how to arbitrate channel access so that all tags are able to answer the reader inquiries and identify themselves over time. This paper stems from the observation that a variety of anti-collision protocols for RFIDs have been proposed in the literature. However, a thorough simulation comparison among them and a clear identification of the mechanisms resulting in better end- to-end performance is lacking. The objective of our work has been to fill this gap. This paper presents the results of a detailed ns2-based comparative evaluation of representatives of all the classes of anti-collision protocols so far proposed. Simulation results show that end-to-end performance of the different classes of protocols in terms of metrics such as the time needed for tags identification differ significantly over what previously found by experiments which only focused on the number of reading cycles for tag identification. Our thorough performance evaluation has highlighted that different solutions are to be used in different application scenarios and that decreasing the collisions (rather than idle times) is the way to go to further improve anti-collision protocols performance

Dynamic M-ary QT Algorithm to Improve the Performance of RFID Tag Identification

“…Tags in one group transmit their IDs to the reader. Since QT and other tree-based protocols [5][6] could not avoid idle cycles, in which there is no tag answering the query sent by reader, the identification performance and efficiency of them are limited.…”

“…The basic idea of the tree-based protocols [5][6][7][8] is to repeatedly split the group of tags encountering collisions into subgroups until there is only one tag in a subgroup to be identified without collisions. Typical tree based algorithms are query tree, collision tree, M-ary query tree.…”

A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process

“…bits set to 5 indicates that the maximal grouping size is 2 5 . Lev bits is set to 4, which refers to the fact that the maximal depth of the binary tree in recursive process is 2 4 . Obviously, bits can be set to 23 as a sum of bits + bits + Lev bits .…”

Modified M-ary QT Algorithm to Improve the Performance of the Anti-collision Protocol for RFID Tag Identification

“…Since QT and other tree-based protocols [8][9][10]cannot avoid idle cycles, in which there is no tag answeringthe query sent by the reader, the identificationperformance and efficiency of them are limited.…”