Query tree-based reservation for efficient RFID tag anti-collision

Since the tree based RFID tag anti-collision protocol achieves 100% read rate, and the slotted ALOHA based tag anti-collision protocol allows simple implementation and good performance in small amount of tags, we consider how to take the advantages of each algorithm. This paper presents query tree b...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2007-01, Vol.11 (1), p.85-87
Main Authors: JI HWAN CHOI, LEE, Dongwook, LEE, Hyuckjae
Format: Article
Language:English
Subjects:
Access methods and protocols, osi model
Algorithms
Applied sciences
Character generation
Collision avoidance
Computer simulation
Exact sciences and technology
Frequency
Intrusion detection
Microwave integrated circuits
Passive RFID tags
Protocols
Query processing
Radio frequency identification
Radiofrequency identification
Radiolocalization and radionavigation
Random number generation
RFID tags
Standardization
Tags
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Trees
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Since the tree based RFID tag anti-collision protocol achieves 100% read rate, and the slotted ALOHA based tag anti-collision protocol allows simple implementation and good performance in small amount of tags, we consider how to take the advantages of each algorithm. This paper presents query tree based reservation for efficient RFID tag anti-collision. According to the simulation results, the proposed protocol requires less time consumption for tag identification than the present tag anti-collision protocols implemented in EPC Class 0, Class 1, and Class 1 Gen. 2
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2007.061471