Optimized binary search with multiple collision bits resolution anti-collision algorithm for efficient RFID tag identification

Younghwan Jung, Daehee Kim, Sun-Shin An

    Research output: Contribution to journalArticlepeer-review

    3 Citations (Scopus)

    Abstract

    In this paper, we analyze two representative tree-based RFID anti-collision algorithms: the Query Tree protocol and the Binary Search algorithm. Based on the advantages and disadvantages of the two al-gorithms, we propose and evaluate two optimized anti-collision algorithms: the Optimized Binary Search, which performs better than the Query Tree Protocol with the same tag-side overhead, and the Optimized Binary Search with Multiple Collision Bits Resolution algorithm, which performs the best with an acceptable increase in tag-side processing overhead.

    Original languageEnglish
    Pages (from-to)1494-1498
    Number of pages5
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE99A
    Issue number7
    DOIs
    Publication statusPublished - 2016 Jul 1

    Keywords

    • Anti-collision
    • Binary search
    • RFID
    • Tag identification

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Graphics and Computer-Aided Design
    • Applied Mathematics
    • Signal Processing

    Fingerprint

    Dive into the research topics of 'Optimized binary search with multiple collision bits resolution anti-collision algorithm for efficient RFID tag identification'. Together they form a unique fingerprint.

    Cite this