Collision-Resilient Symbol Based Extension of Query Tree Protocol for Fast RFID Tag Identification

Authors:
Jae-Min Seol;Seong-Whan Kim
Affiliations:
Department of Computer Science, University of Seoul, Seoul, South Korea;Department of Computer Science, University of Seoul, Seoul, South Korea
Venue:
Information Networking. Towards Ubiquitous Networking and Services
Year:
2008

Citing 6
Cited 0

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

SIAM Journal on Discrete Mathematics
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
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

RFID (RF based identification system) requires identification and collision avoidance schemes for tag singularization. To avoid the collision, there are two previous approaches: ALOHA based and binary tree algorithm.. They are essentially collision avoidance algorithms, and require much overhead in retransmission time. Previous research works on collision recovery protocol cannot distinguish tag collision from channel error. Because channel error significantly influences the overall performance of anti-collision protocols, we propose a robust and efficient tag collision recovery scheme using direct sequence spreading modulation; thereby we can reduce channel errors. Specifically, we propose MSQTP (multi-state query tree protocol) scheme, which is an extension of query tree protocol using modulated symbols. We experimented with two collision resilient symbols: orthogonal (Hadamard) and BIBD (balanced incomplete block design) code. MSQTP shows performance gain (decrease in iteration step for collision recovery) over previous query tree based collision recovery scheme, and shows graceful degradation in noisy environment with lower SNR.