An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags

Jun Bong Eom, Tae Jin Lee, Ronald Rietman, Aylin Yener

    Research output: Contribution to journalArticle

    55 Citations (Scopus)

    Abstract

    Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.

    Original languageEnglish (US)
    Pages (from-to)861-863
    Number of pages3
    JournalIEEE Communications Letters
    Volume12
    Issue number11
    DOIs
    StatePublished - Dec 29 2008

    Fingerprint

    Binary trees
    Radio Frequency Identification
    Radio frequency identification (RFID)
    Collision
    Binary
    Masks
    Binary Tree
    Grouping
    Mask
    Performance Analysis
    Simulation

    All Science Journal Classification (ASJC) codes

    • Modeling and Simulation
    • Computer Science Applications
    • Electrical and Electronic Engineering

    Cite this

    @article{4d5d465291d843df8d761c4dcc94150f,
    title = "An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags",
    abstract = "Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.",
    author = "Eom, {Jun Bong} and Lee, {Tae Jin} and Ronald Rietman and Aylin Yener",
    year = "2008",
    month = "12",
    day = "29",
    doi = "10.1109/LCOMM.2008.081157",
    language = "English (US)",
    volume = "12",
    pages = "861--863",
    journal = "IEEE Communications Letters",
    issn = "1089-7798",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "11",

    }

    An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags. / Eom, Jun Bong; Lee, Tae Jin; Rietman, Ronald; Yener, Aylin.

    In: IEEE Communications Letters, Vol. 12, No. 11, 29.12.2008, p. 861-863.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - An efficient framed-slotted ALOHA algorithm with pilot frame and binary selection for anti-collision of RFID tags

    AU - Eom, Jun Bong

    AU - Lee, Tae Jin

    AU - Rietman, Ronald

    AU - Yener, Aylin

    PY - 2008/12/29

    Y1 - 2008/12/29

    N2 - Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.

    AB - Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.

    UR - http://www.scopus.com/inward/record.url?scp=57849128121&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=57849128121&partnerID=8YFLogxK

    U2 - 10.1109/LCOMM.2008.081157

    DO - 10.1109/LCOMM.2008.081157

    M3 - Article

    AN - SCOPUS:57849128121

    VL - 12

    SP - 861

    EP - 863

    JO - IEEE Communications Letters

    JF - IEEE Communications Letters

    SN - 1089-7798

    IS - 11

    ER -