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

Abstract

Guangjun (2016) Idle-slots elimination based binary splitting anti-collision algorithm for RFID. IEEE Communications Letters, 20 (12). pp. 2394 -2397 . ISSN 1089 This version is available from Sussex Research Online: http://sro.sussex.ac.uk/62036/ 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. Idle-slots elimination based binary splitting (ISE-BS) anti-collision algorithm for RFID Jian Su, Zhengguo Sheng, Liangbo Xie, and Guangjun Wen, Senior member, IEEE Abstract-Tag collision avoidance is critical to the success of data communications in radio frequency identification (RFID) system. This paper presents an efficient idle-slots elimination based binary splitting (ISE-BS) algorithm to improve the performance of RFID system. In ISE-BS, by introducing 1 bit random number Q and 16-bits random number serial identifier (SID) which are transmitted before data exchange, tag collisions can be informed and unnecessary data exchange between reader and tags can be further eliminated. Moreover, ISE-BS exploits Q to separate conflicting tags into '0-1' subsets randomly. Specifically, the tags in subset '0' will start to transmit in the next period, where the success flag signal reflects the immediate data transmission. The tags in subset '1' will wait in the pipeline. In such a way, the idle slots introduced by conventional binary splitting anti-collision algorithms can be removed with schedule of ISE-BS. Extensive simulation results show that ISE-BS outperforms the existing proposed algorithms.

A Fast Hybrid Strategy‐Based RFID Tag Identification Protocol

“…However, because ALOHA-based algorithms randomly schedule data transmissions, some tags cannot be identified for a long time, causing the well-known tag starvation problem [16]. To address this problem, tree-based algorithms have been proposed and extensively studied [8,[15][16][17]. The principle of tree-based algorithms is to recursively divide tags into smaller subsets until each subset has only one or zero tags.…”

“…The direct adaptability of RFID to the demands of supply chains [2][3][4], object tracking and monitoring [5][6][7], traceability of patients, or the management of medication for elderly people are a number of applications that have, in recent years, increased the popularity of this technology. In these broader range of RFID-enabled applications, tag identification problem [8] is one of crucial issues, which is to allow the unread tagged objects appear in the interrogation area to be identified as fast as possible. Tag identification problem happens when unidentified tagged objects are moved in or the tagged objects are misplaced in the region of other readers.…”

A novel RFID multi-tag anti-collision protocol for dynamic vehicle identification

“…The DFSA algorithm (an improvement version of FSA [18–21]) solved the problem by the following two categories [22]. The first category is the tag number estimation algorithm, and a backlog estimation algorithm with satisfied estimation accuracy in [23, 24]. A minimum distance estimation method was proposed in [25] with estimation accuracy is up to 8% when the number of total tags is less than 80.…”

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

“…The same binary tree splitting concept for tag estimation was later adopted by [4] and their most efficient Binary Tree Slotted Aloha (BTSA) protocol achieved 42% efficiency, which this to our knowledge is the most efficient and realizable algorithm to date. Recently, a new anti-collision protocol called ISE-BS (Idle Slot Elimination based Binary Splitting) that achieved around 40.65% efficiency without any tag estimation was proposed in [11]. ISE-BS introduced a special 1-bit Q feedback which enables a complete elimination of idle slots.…”