OPT: Optimal protocol tree for efficient tag identification in dense RFID systems

IEEE International Conference on Communications

Volumn 1, Issue , 2006, Pages 128-133

  Khandelwal, Girish ^a   Yener, Aylin ^a   Chen, Min ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; ONLINE SEARCHING; RADIO FREQUENCY IDENTIFICATION (RFID); SEARCH ENGINES;

COLLISION RESOLUTION; TREE SEARCH ALGORITHMS;

TREES (MATHEMATICS);

EID: 42549101915     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2006.254716     Document Type: Conference Paper

References (9)

1. MIT Auto-ID Center, http://auto-id.mit.edu/.
2. K. Finkenzeller. RFID Handbook: Radio-Frequency Identification Fundamentals and Applications. John Wiley & Sons, 2000.
3. J. Capetanakis. Generalized TDMA: The multi-accessing tree protocol. IEEE Transactions on Communications, COM-27:1476-1484, October 1979.
4. B. Tsybakov. Survey of USSR contributions to random access communications. IEEE Transactions On Information Theory, IT-X, No. 2:143-165, March 1985.
5. J. Massey. Collision-resolution algorithms and random-access communications. Multi-User Communications Systems, Pages:73-99, 1981.
6. Draft protocol specification for a 900 MHz Class 0 Radio Frequency Identification Tag. Technical report, Auto-ID Center, Feb 2003.
7. C. Law, K. Lee, and K. Siu. Efficient memoryless protocol for tag identification. In 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM, pages 75-84, August 2000.
8. 13.56 MHz ISM Band Class 1 Radio Frequency Identification Tag Interface Specification: Recommended Standard, Version 1.0.0. Technical report, Auto-ID Center, May 2003.
9. G. Khandelwal. Efficient design of dense and time constrained RFID systems. M.S. Thesis, The Pennsylvania State University, August 2005.