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

doi:10.1109/LCOMM.2008.081157

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 journal › Article › peer-review

58 Scopus citations

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 language	English (US)
Pages (from-to)	861-863
Number of pages	3
Journal	IEEE Communications Letters
Volume	12
Issue number	11
DOIs	https://doi.org/10.1109/LCOMM.2008.081157
State	Published - 2008

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2008.081157

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",

note = "Funding Information: Manuscript received July 22, 2008. The associate editor coordinating the review of this letter and approving it for publication was M. Dohler. This work was supported by a Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-311-D00658) and the Ministry of Knowledge Economy, Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute for Information Technology Advancement) (IITA-2008-C1090-0803-0002).",

year = "2008",

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",

}

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

N1 - Funding Information: Manuscript received July 22, 2008. The associate editor coordinating the review of this letter and approving it for publication was M. Dohler. This work was supported by a Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-311-D00658) and the Ministry of Knowledge Economy, Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute for Information Technology Advancement) (IITA-2008-C1090-0803-0002).

PY - 2008

Y1 - 2008

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

SN - 1089-7798

VL - 12

SP - 861

EP - 863

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 11

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this