A Study on the Tree based Memoryless Anti-Collision Algorithm for RFID Systems


The KIPS Transactions:PartC, Vol. 11, No. 6, pp. 851-862, Dec. 2004
10.3745/KIPSTC.2004.11.6.851,   PDF Download:

Abstract

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio wave. The multi-tag identification problem is the core issue in the RFID and could be resolved by the anti-collision algorithm. However, most of the existing anti-collision algorithms have a problem of heavy implementation cost and low performance. In this paper, we propose a new tree vased memoryless anti-comllision algorithm called a collision tracking tree algorithm and presents its performance evaluation results obtained by simulation. The Collision Tracking Tree algorithm proves itself the capability of an identification rate of 749 tags per second and the performance evaluation results also show that the proposed algorithm outperforms the other two existing tree-based memoryless algorithms, i.e., the tree-walking algorithm and the query tree algorithm about 49 and 2.4 times repectively.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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. H. Quan, W. K. Hong, Y. D. Lee, H. C. Kim, "A Study on the Tree based Memoryless Anti-Collision Algorithm for RFID Systems," The KIPS Transactions:PartC, vol. 11, no. 6, pp. 851-862, 2004. DOI: 10.3745/KIPSTC.2004.11.6.851.

[ACM Style]
Cheng Hao Quan, Won Kee Hong, Yong Doo Lee, and Hie Cheol Kim. 2004. A Study on the Tree based Memoryless Anti-Collision Algorithm for RFID Systems. The KIPS Transactions:PartC, 11, 6, (2004), 851-862. DOI: 10.3745/KIPSTC.2004.11.6.851.