Performance analysis of tag anti-collision algorithms for RFID systems

  • Authors:
  • Cheng-Hao Quan;Won-Kee Hong;Hie-Cheol Kim

  • Affiliations:
  • RFID System Research Team, ETRI, Daejeon, Korea;School of Information and Communication Eng., Daegu University, Gyeongsan Gyeongbuk, Korea;School of Information and Communication Eng., Daegu University, Gyeongsan Gyeongbuk, Korea

  • Venue:
  • EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Lately, the ISO fixed on UHF Gen2 as one of the standard protocols for RFID, called ISO 18000-6 C, along with ISO 18000-6 A/B. It means that the RFID system should provide the multi-protocol support for tag identification and a proper protocol should be chosen depending on the situation. The tag anti-collision algorithm is one of the important research issues to be on top of the protocol’s performance. This paper introduces several anti-collision algorithms for tag identification in the literature and presents the performance comparison and evaluation of those algorithms based on the 96-bit EPCTM (Electronic Product CodeTM). The performance results show that the collision tracking tree algorithm is found to have the highest performance than any other anti-collision algorithm, identifying 749 tags per second.