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

Girish Khandelwal, Aylin Yener, Min Chen

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

    7 Scopus citations

    Abstract

    We propose a novel collision resolution scheme termed the Optimal Protocol Tree (OPT), which is based on the tree search algorithm for RFID systems. The basic principle of OPT relies on taking advantage of the similarities in the identification strings of different tags, having the reader prompt the tags to send only the mutually exclusive sub-portion of their identification strings. The aim of OPT is to significantly reduce the total identification time, in order to render the deployment of dense RFID systems feasible. Simulation results are presented to demonstrate the performance of OPT, and the considerable improvement it provides with respect to the existing tree search protocols.

    Original languageEnglish (US)
    Title of host publication2006 IEEE International Conference on Communications, ICC 2006
    Pages128-133
    Number of pages6
    DOIs
    StatePublished - 2006
    Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
    Duration: Jul 11 2006Jul 15 2006

    Publication series

    NameIEEE International Conference on Communications
    Volume1
    ISSN (Print)0536-1486

    Other

    Other2006 IEEE International Conference on Communications, ICC 2006
    Country/TerritoryTurkey
    CityIstanbul
    Period7/11/067/15/06

    All Science Journal Classification (ASJC) codes

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Fingerprint

    Dive into the research topics of 'OPT: Optimal protocol tree for efficient tag identification in dense RFID systems'. Together they form a unique fingerprint.

    Cite this