Collision-Resilient Multi-state Query Tree Protocol for Fast RFID Tag Identification

Authors:
Jae-Min Seol;Seong-Whan Kim
Affiliations:
Department of Computer Science, University of Seoul, Jeon-Nong-Dong, Seoul, Korea;Department of Computer Science, University of Seoul, Jeon-Nong-Dong, Seoul, Korea
Venue:
Computational Intelligence and Security
Year:
2007

Citing 4
Cited 0

RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification

RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Evaluating and optimizing power consumption of anti-collision protocols for applications in RFID systems

Proceedings of the 2004 international symposium on Low power electronics and design
Novel Anti-collision Algorithms for Fast Object Identification in RFID System

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

RFID (radio frequency identification) is a RF based identification system, where RF reader reads (and writes) data from each entity (RF tag). Upon request from reader, tags in reader's accessible RF range will respond, and if the number of tags is larger than 2, the reader cannot identify tags (collision). To avoid the collision, there are two previous approaches: ALOHA based and binary tree algorithm. However, they are essentially collision avoidance algorithms, and require much overhead in retransmission time. In this paper, we present collision recovery scheme for RFID system. It uses 20 symbols, and each symbol is 16-bit vectors derived from (16, 4, 1)-BIBD (balanced Incomplete Block design) which is resilient to collision. Although our scheme can decrease the total number of support users, it shows good performance even with low SNR region.