An Anti-collision Algorithm using Tag Mapping based on RFID System 


Vol. 33,  No. 4, pp. 89-93, Apr.  2008


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 algorithm 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 tree based memoryless algorithms that compose of almost every class of existing anti-collision algorithms. To compare the performance, we evaluated each class of anti-collision algorithms with respect to RFID system with 96-bit EPC(Electronic Product Code). The results show that the tag mapping algorithm outperforms current tree based algorithms by at least 4 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]

Y. Park, J. Park, Y. Oh, "An Anti-collision Algorithm using Tag Mapping based on RFID System," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 4, pp. 89-93, 2008. DOI: .

[ACM Style]

Yong-min Park, Ju-hee Park, and Young-hwan Oh. 2008. An Anti-collision Algorithm using Tag Mapping based on RFID System. The Journal of Korean Institute of Communications and Information Sciences, 33, 4, (2008), 89-93. DOI: .

[KICS Style]

Yong-min Park, Ju-hee Park, Young-hwan Oh, "An Anti-collision Algorithm using Tag Mapping based on RFID System," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 4, pp. 89-93, 4. 2008.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880