Using Generalized Query Tree to Cope with the Capture Effect in RFID Singulation

The Query Tree Protocol (QT) in Law et al. (2000) is an efficient RFID tag singulation algorithm that is guaranteed to read all the tags in the broadcast range of a reader. However, QT ignores the capture effect. That is, after the reader broadcasts a bit string query prefix, it is assumed that it c...

Full description

Saved in:
Bibliographic Details
Main Authors: Wu, V.K.Y., Campbell, R.H.
Format: Conference Proceeding
Language:English
Subjects:
Analytical models
Backscatter
Broadcasting
Computer science
Decoding
Intrusion detection
Passive RFID tags
Radiofrequency identification
RFID tags
Wireless application protocol
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Query Tree Protocol (QT) in Law et al. (2000) is an efficient RFID tag singulation algorithm that is guaranteed to read all the tags in the broadcast range of a reader. However, QT ignores the capture effect. That is, after the reader broadcasts a bit string query prefix, it is assumed that it can distinguish one of three responses, namely {no response, one response, collision}. If the capture effect is modeled, QT would no longer be guaranteed to singulate all the tags in the reader's range, since "capturing" a tag ID in the midst of a collision would leave all the other tags in that collision unsingulated. In this paper, we introduce two modifications to QT that always singulate all the tags even when the capture effect is considered. We call these the Generalized Query Tree Protocols (GQT1, GQT2). We provide analytical bounds and simulation results of the singulation times of these new protocols in relation to QT.
ISSN:2331-9852
DOI:10.1109/CCNC.2009.4784899