QT-CBP: A New RFID Tag Anti-collision Algorithm Using Collision Bit Positioning

  • Hyunji Lee
  • Jongdeok Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4097)


The ability to recognize many tags simultaneously is crucial for many advanced RFID-based applications. The tag anti-collision algorithm of an RFID system, which arbitrates collisions on the air interface among tags in the same reading range of a reader, makes a great influence on the speed and the reliability in multiple tag recognition. This paper presents a new memoryless tag anti-collision algorithm, QT-CBP (Query Tree with Collision Bit Positioning), which is designed based on QT (Query Tree) algorithm. QT-CBP is likely to make more concise tree traversal than QT by extracting and making use of detailed information on a collision condition, such as the number of collision bits and their positions. Basically QT-CBP is an enhanced algorithm for readers running QT, so no change is required at tags. Simulation study shows that QT-CBP outperforms QT, especially on the condition where tags have similar tag IDs by having the same company or product ID prefixes.


Object Class Electronic Product Code Tree Traversal Reading Range Serial Code 


  1. 1.
    Law, C., Lee, K., Sju, K.-Y.: Efficient Momoryless Protocol for Tag Identification. In: Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication, Boston, MA, August 2000, pp. 75–84 (2000)Google Scholar
  2. 2.
    Juels, A., Rivest, R., Szydlo, M.: The Blocker Tag: Selective Tag Blocking of RFID Tags for Consumer Privacy. In: Proceedings of the 10th ACM Conference on Computer and Communication Security, pp. 103–111 (2003)Google Scholar
  3. 3.
    Hush, D.R., Wood, C.: Analysis of Tree Algorithm for RFID Arbitration. In: Proceedings of IEEE International Symposium on Information Theory, pp. 107–116 (1998)Google Scholar
  4. 4.
    Jacomet, M., Ehrsam, A., Gehrig, U.: Contact-less identification device with anti-collision algorithm. In: Proceedings of IEEE Conference on Circuits, Systems, Computers and Communications, Athens (July 1999)Google Scholar
  5. 5.
    Kim, C., Park, K., Kim, H., Kim, S.: An Efficient Stochastic AntiCollision Algorithm using Bit-slot Mechanism. In: PDP 2004 (July 2004)Google Scholar
  6. 6.
    Vogt, H.: Efficient Object Identification with Passive RFID Tags. In: Proceedings of International Conference on Pervasive Computing, Zurich (2002)Google Scholar
  7. 7.
    Auto-ID Center, 13.56 MHz ISM Banc Class 1 Radio Frequency Identification Tag Interface Specification, Version 1.0, Auto-ID Center (May 2003) Google Scholar
  8. 8.
    Myung, J., Lee, W.: An Adaptive Memoryless Tag Anti-Collision Protocol for RFID Networks. In: Proceeding of the 24th IEEE Annual Conference on Computer Communications (INFOCOM 2005), Miami, Florida (March 2005)Google Scholar
  9. 9.
    Auto-ID Center, EPCTM Tag Data Standards Version 1.3, Auto-ID Center (September 2005)Google Scholar
  10. 10.
    Auto-ID Center, Draft protocol specification for a 900MHz Class 0 Radio Frequency Identification Tag, Auto-ID Center (February 2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hyunji Lee
    • 1
  • Jongdeok Kim
    • 1
  1. 1.Dept. of Computer Science and EngineeringPusan National University 

Personalised recommendations