Hybrid Dynamic-Binary ALOHA Anti-Collision Protocol in RFID Systems

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    The main techniques for identifying objects in an Internet of things environment are based on radio frequency identification, in which a specific object is identified by the reader through the tag mounted on the object. When there are multiple tags in the reader’s interrogation zone, they respond simultaneously to the reader’s request, thus causing a collision between the signals sent simultaneously to the reader from those tags. Such collisions reduce the data accuracy and prolong the identification time, thus making it difficult to provide a rapid service. This paper explores a hybrid anti-collision protocol, namely, the hybrid dynamic-binary ALOHA anti-collision protocol, which is designed to prevent tag collision and to enable more stable information transmission by improving the existing tag anti-collision protocols. The proposed protocol has achieved performance enhancement by shortening the tag identification process when tag collision occurs by combining the ALOHA and binary search protocols. In contrast to the existing protocols, whereby the reader’s request is repeated after detecting a collision, the proposed protocol shortens the tag identification time by requesting only the collision bits. This contributes to a substantial reduction in the object identification time in an IoT environment.



  • Keywords

    RFID; Tag collision; Reader collision; ALOHA; Binary search tree; IoT.

  • References

      [1] Sabita Maharjan (2010), “RFID and IoT: An overview”, Simula Research Laboratory, University of Oslo.

      [2] Don R. Hush & Cliff Wood (1998), “Analysis of Tree Algorithms for RFID Arbitration”, In IEEE International Symposium on Information Theory.

      [3] Yin Zhang, Fan Yang, Qian Wang, Qianlin He, JiaCheng Li & Yue Yang (2017), “An anti-collision algorithm for RFID-based robots based on dynamic grouping binary trees”, Computers & Electrical Engineering, Vol. 63, 91–98.

      [4] Ming-Kuei Yeh, Yung-Liang Lai & Jehn-Ruey Jiang (2014), “An Efficient Query Tree protocol for RFID tag anti-collision”, 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS), 926–930. https://doi.org/10.1109/PADSW.2014.709791 0.

      [5] Jihoon Myung & Wonjun Lee (2005), “An Adaptive Memoryless Tag Anti-Collision Protocol for RFID Networks”, the 24th IEEE Annual Conference on Computer Communications (INFOCOM).

      [6] Jae-Dong Shin, Sang-Soo Yeo, Tai-Hoon Kim & Sung Kwon Kim (2007), “Hybrid Tag Anti-collision Algorithms in RFID Systems”, International Conference on Computational Science (ICCS) , LNCS 4490, 693–700.

      [7] Vinod Namboodiri, Maheesha DeSilva, Kavindya Deegala & Suresh Ramamoorthy (2012), “An extensive study of slotted Aloha-based RFID anti-collision protocols”, Computer Communications, Vol. 35(16), 1955–1966. https://doi.org/10.1016/j.comcom.2012.05.015.

      [8] Ying Xu & Yifan Chen (2015), “An improved dynamic framed slotted ALOHA Anti-collision algorithm based on estimation method for RFID systems”, IEEE International Conference on RFID. https://doi.org/10.1109/RFID.2015.7113066.

      [9] Jae-Ryong Cha & Jae-Hyun Kim (2005), “Novel Anti-collision Algorithms for Fast Object Identification in RFID System”, ICPADS.

      [10] OMNet++: available online: https://www.omnetpp.org/

      [11] Spatial data generator, DaVisual Code1.0. available online: http://isl.cs.unipi.gr.




Article ID: 12566
DOI: 10.14419/ijet.v7i2.15.12566

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.