Performance Evaluation of Anti-collision Algorithms in the Low-cost RFID System 


Vol. 30,  No. 1, pp. 17-26, Jan.  2005


PDF
  Abstract

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects attached with electronic tags by using radio wave For the implementation of an RFID system, an anti-collision algonthm is required to Identify several tags within the RFID reader's range Few researches report the performance trade-off among anti-collision algorithms in terms of the communications traffic between the reader and tags, the Identification speed, and so on In this paper, we analyze both tree based memoryless algonthms and slot aloha based algorithms that compose of almost every class of existing anti-collision algorithms To compare the performance, we evaluated each class of anti-collision algonthms with respect to low-cost RFID system with 96-bit EPC(Electronic Product Code) The results show that the collision tracking tree algorithm outperforms current tree based and aloha based algonthms by at least 2 times to 50 times.

  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]

C. Quan, W. Hong, Y. Lee, H. Kim, "Performance Evaluation of Anti-collision Algorithms in the Low-cost RFID System," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 1, pp. 17-26, 2005. DOI: .

[ACM Style]

Cheng-hao Quan, Won-kee Hong, Yong-doo Lee, and Hie-cheol Kim. 2005. Performance Evaluation of Anti-collision Algorithms in the Low-cost RFID System. The Journal of Korean Institute of Communications and Information Sciences, 30, 1, (2005), 17-26. DOI: .

[KICS Style]

Cheng-hao Quan, Won-kee Hong, Yong-doo Lee, Hie-cheol Kim, "Performance Evaluation of Anti-collision Algorithms in the Low-cost RFID System," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 1, pp. 17-26, 1. 2005.