A Collision-Tolerant-Based Anti-Collision Algorithm for Large Scale RFID System

Abstract

Liangbo (2017) A collision-tolerant based anti-collision algorithm for large scale RFID system. IEEE Communications Letters. ISSN 1089-7798 This version is available from Sussex Research Online: http://sro.sussex.ac.uk/67136/ This document is made available in accordance with publisher policies and may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher's version. Please see the URL above for details on accessing the published version. Copyright and reuse:Sussex Research Online is a digital repository of the research output of the University.Copyright and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable, the material made available in SRO has been checked for eligibility before being made available.Copies of full text items generally can be reproduced, displayed or performed and given to third parties in any format or medium for personal research or study, educational, or not-for-profit purposes without prior permission or charge, provided that the authors, title and full bibliographic details are credited, a hyperlink and/or URL is given for the original metadata page and the content is not changed in any way. Abstract-Tag identification is an important issue in RFID system. Most existing anti-collision algorithms solely focus on reducing collision probability while suffering from vast idle slots. This paper proposes a collision-tolerant dynamic framed slotted Aloha (CE-DFSA) algorithm which attempts to identify multiple tags in a slot to reduce the total identification time in the process of identification. In CE-DFSA, tags are allocated with orthogonal Walsh Sequence (WS) so that multiple tags can be identified in a time slot without spreading the spectrum. Simulation results show that the proposed algorithm considerably accelerates the tag identification process with improved efficiency compared with existing anti-collision algorithms.

A fast tag identification anti‐collision algorithm for RFID systems

“…They focus on the frame size adjustment to perform dynamic FSA. The proposed methods in previous studies can achieve a system efficiency close to the theoretical limit of ALOHA‐based algorithms of 36.8%. More recently, Su, Sheng, Hong, et al introduces an early frame breaking policy in Dynamic Frame Slotted Aloha (DFSA) to identify a suitable frame size to currently presenting tags in the system.…”

A Collision Resolution Algorithm for RFID Using Modified Dynamic Tree With Bayesian Tag Estimation

“…Although the system efficiency has been the most common measure of performance for anti-collision protocols, recent studies for RFID systems aim at maximizing the time system efficiency as it takes into account the fact that idle slots are shorter than succesful and collision and various recommended time parameters as defined in the EPCglobal Gen 2 standard play a part in the actual time required for tag identification. Therefore, we apply the proposed algorithm to the RFID system according to the EPCglobal Gen 2 standard at data rate of 40 kbps with time parameters as given in Table 1 of [13]. Numerical results given in Fig 4 show that the BE-MDT can achieve better time system efficiency than all other algorithms, even the BSTSA which is primarily designed and optimized for maximum time system efficiency.…”

Frame Size Analysis of Optimum Dynamic Tree in RFID Systems

“…Hence, all tags can be known within a certain timeslot. The treebased algorithms are practically more ideal and focused in this paper [9][10][11][12][13][14].…”