An Improved Anti-Collision Algorithm using the Number of Collision Bits in RFID System 


Vol. 35,  No. 10, pp. 968-977, Oct.  2010


PDF
  Abstract

RFID enables the automatic identification of the electronic tag attached to an object without contact. This paper proposes a QT-DCBP(Query Tree - Double Collision Bit Partitioning) algorithm, which is a modified version of the Query Tree algorithm, as a multiple tag identification algorithm. It is based on the number of collided bits and the density of tags residing in the reader area. If the number of collided bits is greater than or equal to 3 and all the bits received from the tags are collided, the new prefix is made by fixing the first 2 collided bits as ‘00’, ‘01’, ‘10’, ‘11’. The simulation results show that the proposed QT-DCBP's performance is 30∼50% higher than that of QT algorithm and is 10∼20% higher than that of QT-CBP algorithm.

  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]

M. Kim and K. Kook, "An Improved Anti-Collision Algorithm using the Number of Collision Bits in RFID System," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 10, pp. 968-977, 2010. DOI: .

[ACM Style]

Myeoung-Hwan Kim and Kwang-Ho Kook. 2010. An Improved Anti-Collision Algorithm using the Number of Collision Bits in RFID System. The Journal of Korean Institute of Communications and Information Sciences, 35, 10, (2010), 968-977. DOI: .

[KICS Style]

Myeoung-Hwan Kim and Kwang-Ho Kook, "An Improved Anti-Collision Algorithm using the Number of Collision Bits in RFID System," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 10, pp. 968-977, 10. 2010.