Using generalized Query Tree to cope with the capture effect in RFID singulation

Victor K.Y. Wu, Roy H. Campbell

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Query Tree Protocol (QT) in [1] 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.

Original languageEnglish (US)
Title of host publication2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
DOIs
StatePublished - 2009
Event2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009 - Las Vegas, NV, United States
Duration: Jan 10 2009Jan 13 2009

Publication series

Name2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009

Other

Other2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009
Country/TerritoryUnited States
CityLas Vegas, NV
Period1/10/091/13/09

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint

Dive into the research topics of 'Using generalized Query Tree to cope with the capture effect in RFID singulation'. Together they form a unique fingerprint.

Cite this