Journal of Computer and Communications

Volume 3, Issue 5 (May 2015)

ISSN Print: 2327-5219   ISSN Online: 2327-5227

Google-based Impact Factor: 1.12  Citations  

Parallel Response Ternary Query Tree for RFID Tag Anti-Collision

HTML  XML Download Download as PDF (Size: 706KB)  PP. 72-79  
DOI: 10.4236/jcc.2015.35009    3,345 Downloads   4,407 Views  Citations

ABSTRACT

A tag-collision (or missed reads) in RFID system (Radio Frequency Identification) system degrades the identification efficiency. The so-called tag collision is that a reader cannot identify a tag when more than one tags respond to a reader at the same time. There are some major anti-collision protocols on resolving tag collision, e.g., ALOHA-based protocol, binary tree protocol, and Query Tree (QT) protocol. Up to date, most tag anti-collision protocols are QT protocols. QT protocols are categorized into M-ary query tree (QT). In the previous literature, choosing M = 3 (i.e., a ternary QT (TQT)) was proven to have the optimum performance for tag identification. Recently, Yeh et al. used parallel response approach to reduce the number of collisions. In this paper, we combine the partial response and TQT to propose an effective parallel response TQT (PRTQT) protocol. Simulation results reveal that our PRTQT outperforms Yeh et al.’s protocol and TQT protocol.

Share and Cite:

Yang, C. , Cai, S. and Sun, L. (2015) Parallel Response Ternary Query Tree for RFID Tag Anti-Collision. Journal of Computer and Communications, 3, 72-79. doi: 10.4236/jcc.2015.35009.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.