Enhanced Anti-Collision Protocol for Identification Systems 


Vol. 36,  No. 9, pp. 1092-1097, Sep.  2011


PDF
  Abstract

An anti-collision protocol which tries to minimize the collision probability and identification time is the most important factor in all identification technologies. This paper focuses on methods to improve the efficiency of tag's process in identification systems. Our scheme, Binary Slotted Query Tree (BSQT) algorithm, is a memoryless protocol that identifies an object's ID more efficiently by removing the unnecessary prefixes of the traditional Query Tree (QT) algorithm. With enhanced QT algorithm, the reader will broadcast 1 bit and wait the response from the tags but the difference in this scheme is the reader will listen in 2 slots (slot 1 is for 0 bit Tags and slot 2 is for 1 bit Tags). Base on the responses the reader will decide next broadcasted bit. This will help for the reader to remove some unnecessary broadcasted bits which no tags will response. Numerical and simulation results show that the proposed scheme decreases the tag identification time by reducing the overall number of request.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

N. Le, S. Choi, Y. M. Jang, "Enhanced Anti-Collision Protocol for Identification Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 9, pp. 1092-1097, 2011. DOI: .

[ACM Style]

Nam-Tuan Le, Sunwoong Choi, and Yeong Min Jang. 2011. Enhanced Anti-Collision Protocol for Identification Systems. The Journal of Korean Institute of Communications and Information Sciences, 36, 9, (2011), 1092-1097. DOI: .

[KICS Style]

Nam-Tuan Le, Sunwoong Choi, Yeong Min Jang, "Enhanced Anti-Collision Protocol for Identification Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 9, pp. 1092-1097, 9. 2011.