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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Finkenzeller, K.: RFID Handbook, Fundamentals and Application in Contact-less Smart Card and Identification, 2nd edn., pp. 195–219. John Wiley & Sons Ltd., Chichester (2003)
ISO/IEC 18000 Part 3- Parameters for Air Interface Communications at 13.56MHz, RFID Air Interface Standards
Cha, J., Kim, J.: Novel Anti-collision Algorithm for Fast Object Identification in RFID System. In: IEEE ICPADS, pp. 63–67 (2005)
Vogt, H.: Multiple object identification with passive RFID tags. In: IEEE Int. Conf. on System, Man and Cybernetics, vol. 3, pp. 6–9 (2002)
MIT Auto-ID Center, Draft protocol specification for a 900MHz Class 0 Radio Frequency Identification Tag (February 2003), http://www.epcglobalinc.org/
Myung, J., Lee, W.: An Adaptive Memoryless Tag Anti-Collision Protocol for RFID Netwroks. In: IEEE INFOCOM (2005)
Zhou, F., Chen, C., Jin, D., Huang, C., Min, H.: Evaluation and Optimizing Power Consumption of Anti-Collision Protocols for Applications in RFID System. In: ACM ISLPED 2004, pp. 357–362 (2004)
Guruswami, V., Sudan, M.: Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes. IEEE Trans. on Information Theory 45, 1757–1767 (1999)
Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Design. CRC Press, Boca Raton (1996)
Stinson, D.R., Wei, R.: Combinatorial Properties and Construction of traceability Schemes and Frameproof Codes. SIAM Journal on Discrete Mathematics 11, 41–53 (1998)
Stinson, D.R., Trung, T.V., Wei, R.: Secure Frameproof Code, Key Distribution Patterns, Group Testing Algorithm and Related Structures. J. Statist. Planning Inference 86, 595–671 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seol, JM., Kim, SW. (2008). Collision-Resilient Symbol Based Extension of Query Tree Protocol for Fast RFID Tag Identification. In: Vazão, T., Freire, M.M., Chong, I. (eds) Information Networking. Towards Ubiquitous Networking and Services. ICOIN 2007. Lecture Notes in Computer Science, vol 5200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89524-4_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-89524-4_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89523-7
Online ISBN: 978-3-540-89524-4
eBook Packages: Computer ScienceComputer Science (R0)