Sidewalk: A RFID tag anti-collision algorithm exploiting sequential arrangements of tags

Hyunho Koh, Sangki Yun, Hyogon Kim

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

5 Citations (Scopus)

Abstract

Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the tags have a sequential arrangement. In large-scale applications such as supply chain management, for instance, hundreds or thousands of the same type of product made by the same manufacturer can be stacked together in the stock. In this paper, we propose a simple RFID tag anti-collision algorithm that exploits such sequential structure of the given tag space to achieve a higher read efficiency. The proposed algorithm is also designed to still achieve the level of performance comparable to that of existing algorithms if tags exhibit little sequential structure. Through exhaustive simulations over various tag distributions, we demonstrate that the proposed algorithm achieves at least 10% improvement even in the worst case (i.e., when tags are completely randomly distributed), but yields significantly higher improvement when the number of tags and/or the correlation increases.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages2597-2601
Number of pages5
DOIs
Publication statusPublished - 2008 Sep 12
EventIEEE International Conference on Communications, ICC 2008 - Beijing, China
Duration: 2008 May 192008 May 23

Other

OtherIEEE International Conference on Communications, ICC 2008
CountryChina
CityBeijing
Period08/5/1908/5/23

Fingerprint

Radio frequency identification (RFID)
Supply chain management

ASJC Scopus subject areas

  • Media Technology

Cite this

Koh, H., Yun, S., & Kim, H. (2008). Sidewalk: A RFID tag anti-collision algorithm exploiting sequential arrangements of tags. In IEEE International Conference on Communications (pp. 2597-2601). [4533528] https://doi.org/10.1109/ICC.2008.492

Sidewalk : A RFID tag anti-collision algorithm exploiting sequential arrangements of tags. / Koh, Hyunho; Yun, Sangki; Kim, Hyogon.

IEEE International Conference on Communications. 2008. p. 2597-2601 4533528.

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

Koh, H, Yun, S & Kim, H 2008, Sidewalk: A RFID tag anti-collision algorithm exploiting sequential arrangements of tags. in IEEE International Conference on Communications., 4533528, pp. 2597-2601, IEEE International Conference on Communications, ICC 2008, Beijing, China, 08/5/19. https://doi.org/10.1109/ICC.2008.492
Koh H, Yun S, Kim H. Sidewalk: A RFID tag anti-collision algorithm exploiting sequential arrangements of tags. In IEEE International Conference on Communications. 2008. p. 2597-2601. 4533528 https://doi.org/10.1109/ICC.2008.492
Koh, Hyunho ; Yun, Sangki ; Kim, Hyogon. / Sidewalk : A RFID tag anti-collision algorithm exploiting sequential arrangements of tags. IEEE International Conference on Communications. 2008. pp. 2597-2601
@inproceedings{f716006ddcfb46aabcb8bc88e4b74f93,
title = "Sidewalk: A RFID tag anti-collision algorithm exploiting sequential arrangements of tags",
abstract = "Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the tags have a sequential arrangement. In large-scale applications such as supply chain management, for instance, hundreds or thousands of the same type of product made by the same manufacturer can be stacked together in the stock. In this paper, we propose a simple RFID tag anti-collision algorithm that exploits such sequential structure of the given tag space to achieve a higher read efficiency. The proposed algorithm is also designed to still achieve the level of performance comparable to that of existing algorithms if tags exhibit little sequential structure. Through exhaustive simulations over various tag distributions, we demonstrate that the proposed algorithm achieves at least 10{\%} improvement even in the worst case (i.e., when tags are completely randomly distributed), but yields significantly higher improvement when the number of tags and/or the correlation increases.",
author = "Hyunho Koh and Sangki Yun and Hyogon Kim",
year = "2008",
month = "9",
day = "12",
doi = "10.1109/ICC.2008.492",
language = "English",
isbn = "9781424420742",
pages = "2597--2601",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Sidewalk

T2 - A RFID tag anti-collision algorithm exploiting sequential arrangements of tags

AU - Koh, Hyunho

AU - Yun, Sangki

AU - Kim, Hyogon

PY - 2008/9/12

Y1 - 2008/9/12

N2 - Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the tags have a sequential arrangement. In large-scale applications such as supply chain management, for instance, hundreds or thousands of the same type of product made by the same manufacturer can be stacked together in the stock. In this paper, we propose a simple RFID tag anti-collision algorithm that exploits such sequential structure of the given tag space to achieve a higher read efficiency. The proposed algorithm is also designed to still achieve the level of performance comparable to that of existing algorithms if tags exhibit little sequential structure. Through exhaustive simulations over various tag distributions, we demonstrate that the proposed algorithm achieves at least 10% improvement even in the worst case (i.e., when tags are completely randomly distributed), but yields significantly higher improvement when the number of tags and/or the correlation increases.

AB - Although predicting the RFID tag distribution before a read cycle begins would be generally difficult and even futile, a likely and interesting scenario is where the tags have a sequential arrangement. In large-scale applications such as supply chain management, for instance, hundreds or thousands of the same type of product made by the same manufacturer can be stacked together in the stock. In this paper, we propose a simple RFID tag anti-collision algorithm that exploits such sequential structure of the given tag space to achieve a higher read efficiency. The proposed algorithm is also designed to still achieve the level of performance comparable to that of existing algorithms if tags exhibit little sequential structure. Through exhaustive simulations over various tag distributions, we demonstrate that the proposed algorithm achieves at least 10% improvement even in the worst case (i.e., when tags are completely randomly distributed), but yields significantly higher improvement when the number of tags and/or the correlation increases.

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

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

U2 - 10.1109/ICC.2008.492

DO - 10.1109/ICC.2008.492

M3 - Conference contribution

AN - SCOPUS:51249123297

SN - 9781424420742

SP - 2597

EP - 2601

BT - IEEE International Conference on Communications

ER -