An Effective Frame Breaking Policy for Dynamic Framed Slotted Aloha in RFID

Abstract

Guangjun (2016) An effective frame breaking policy for dynamic framed slotted aloha in RFID. IEEE Communications Letters, 20 (4). pp. 692-695. ISSN 1089-7798 This version is available from Sussex Research Online: http://sro.sussex.ac.uk/59314/ 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 collision problem is considered as one of the critical issues in RFID system. To further improve the identification efficiency of UHF RFID system, a frame breaking policy is proposed with dynamic framed slotted aloha algorithm. Specifically, the reader makes effective use of idle, successful and collision statistics during the early observation phase to recursively determine the optimal frame size. Then the collided tags in each slot will be resolved by individual frames. Simulation results show that the proposed algorithm achieves a better identification performance compared with the existing Alohabased algorithms.

Idle-Slots Elimination Based Binary Splitting Anti-Collision Algorithm for RFID

“…To compare the reliability [9], the fluctuate ratio of variables (e.g. system throughput or time efficiency) can be defined as…”

“…Technically, query tree (QT) [6][7] based algorithms are considered as a deterministic method derived from a collision bit identification and tracking technique. However, along with the increasing number of tags, the position of collision bit cannot be detected efficiently since the wide deviation of received signals at a reader [8][9]. Therefore, it is difficult to implement QT-based algorithms of UHF RFID in real-time systems.…”

A Reduced Complexity of Vahedi's Tag Estimation Method for DFSA

“…In RFID systems, collision resolution protocols can be categorized into three types, namely tree, ALOHA and query tree (QT) based algorithms [10]. The tree algorithms subgroup the collided tags recursively through a tree structure until each leaf node of the tree contains one tag or none.…”

“…This procedure is carried out repeatedly until all collisions are completely resolved, and hence each tag is uniquely identified. M-ary tree concept is also available in literature where the collided tags are divided into M number of subgroups [10][11][12][13] instead of two as in the binary tree algorithm.…”

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

“…To enhance the performance and reduce the complexity of DFSA, latest energy efficient algorithms have been developed [7][8]. The literature [7] proposed an Improved Linearized Combinatorial Model (ILCM) that only incurs a modest calculation cost, and can be easily implemented as a tag backlog estimation method.…”