Q+-Algorithm: An enhanced RFID tag collision arbitration algorithm

Donghwan Lee, Kyungkyu Kim, Wonjun Lee

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

35 Citations (Scopus)

Abstract

Emerging applications of RFID require high efficiency of tag identification. Since passive tags have dumb functionality, the efficiency of tag identification in RFID system relies on the performance of the collision arbitration algorithm embedded in a reader. In this paper, we develop a novel collision arbitration algorithm, which is named Q+ -Algorithm, improving Q-Algorithm which is introduced in a standard, EPCglobal Class-1 Generation-2. We maximized the efficiency of tag identification by modifying and optimizing the parameters used in Q-Algorithm. Simulation-based performance evaluation proves that our scheme shows the best identification efficiency among the diverse solutions.

Original languageEnglish
Title of host publicationUbiquitous Intelligence and Computing - 4th International Conference, UIC 2007, Proceedings
PublisherSpringer Verlag
Pages23-32
Number of pages10
ISBN (Print)9783540735489
DOIs
Publication statusPublished - 2007
Event4th International Conference on Ubiquitous Intelligence and Computing: Building Smart Worlds in Real and Cyber Spaces, UIC 2007 - Hong Kong, Hong Kong
Duration: 2007 Jul 112007 Jul 13

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4611 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Ubiquitous Intelligence and Computing: Building Smart Worlds in Real and Cyber Spaces, UIC 2007
Country/TerritoryHong Kong
CityHong Kong
Period07/7/1107/7/13

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Q<sup>+</sup>-Algorithm: An enhanced RFID tag collision arbitration algorithm'. Together they form a unique fingerprint.

Cite this