A novel tag identification algorithm for RFID system using UHF

Authors:
Ho-Seung Choi;Jae-Hyun Kim
Affiliations:
School of Electrical and Computer Engineering, Ajou University, Suwon, Korea;School of Electrical and Computer Engineering, Ajou University, Suwon, Korea
Venue:
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Year:
2005

Citing 3
Cited 1

Radio Frequency Identification and the Electronic Product Code

IEEE Micro
Efficient Object Identification with Passive RFID Tags

Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Improved bit-by-bit binary tree algorithm in ubiquitous ID system

PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II

An enhanced ubiquitous identification system using fast anti-collision algorithm

UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An anti-collision algorithm is very important in the RFID system, because it decides tag identification time and tag identification accuracy. We propose improved anti-collision algorithms for RFID system using UHF. In the proposed algorithms, if the reader memorizes the Bin slot information, it can reduce the repetition of the unnecessary PingID command and the time to identify tags. If we also use ScrollAllID command in the proposed algorithm, the reader knows the sequence of collided ID bits. Using this sequence, we can reduce the repetition of PingID command and tag identification time. We analyze the performance of the proposed anti-collision algorithms and compare the performance of the proposed algorithms with that of the conventional algorithm. We also validate analytic results using simulation. According to the analysis, for the random tag ID, comparing the proposed algorithms with the conventional algorithm, the performance of the proposed algorithms is about 130% higher when the number of the tags is 200. For the sequential tag ID, the performance of the conventional algorithm decreases. On the contrary, the performance of the proposed algorithm using ScrollAllID command is about 16% higher than the case of using random tag ID.