Extending birthday paradox theory to estimate the number of tags in RFID systems

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

The main objective of Radio Frequency Identification systems is to provide fast identification for tagged objects. However, there is always a chance of collision, when tags transmit their data to the reader simultaneously. Collision is a timeconsuming event that reduces the performance of RFID systems. Consequently, several anti-collision algorithms have been proposed in the literature. Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular of these algorithms. DFSA dynamically modifies the frame size based on the number of tags. Since the real number of tags is unknown, it needs to be estimated. Therefore, an accurate tag estimation method has an important role in increasing the efficiency and overall performance of the tag identification process. In this paper, we propose a novel estimation technique for DFSA anti-collision algorithms that applies birthday paradox theory to estimate the number of tags accurately. The analytical discussion and simulation results prove that the proposed method increases the accuracy of tag estimation and, consequently, outperforms previous schemes.

Original languageEnglish
Article numbere95425
JournalPLoS One
Volume9
Issue number4
DOIs
Publication statusPublished - 21 Apr 2014

Fingerprint

Radio Frequency Identification Device
Radio frequency identification (RFID)
radio frequency identification
Identification (control systems)
methodology

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Medicine(all)

Cite this

Extending birthday paradox theory to estimate the number of tags in RFID systems. / Shakiba, Masoud; Jit Singh, Mandeep Singh; A Sundararajan, Elankovan; Zavvari, Azam; Islam, Mohammad Tariqul.

In: PLoS One, Vol. 9, No. 4, e95425, 21.04.2014.

Research output: Contribution to journalArticle

@article{4382f904489a4f2f9799b67ac57d1dda,
title = "Extending birthday paradox theory to estimate the number of tags in RFID systems",
abstract = "The main objective of Radio Frequency Identification systems is to provide fast identification for tagged objects. However, there is always a chance of collision, when tags transmit their data to the reader simultaneously. Collision is a timeconsuming event that reduces the performance of RFID systems. Consequently, several anti-collision algorithms have been proposed in the literature. Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular of these algorithms. DFSA dynamically modifies the frame size based on the number of tags. Since the real number of tags is unknown, it needs to be estimated. Therefore, an accurate tag estimation method has an important role in increasing the efficiency and overall performance of the tag identification process. In this paper, we propose a novel estimation technique for DFSA anti-collision algorithms that applies birthday paradox theory to estimate the number of tags accurately. The analytical discussion and simulation results prove that the proposed method increases the accuracy of tag estimation and, consequently, outperforms previous schemes.",
author = "Masoud Shakiba and {Jit Singh}, {Mandeep Singh} and {A Sundararajan}, Elankovan and Azam Zavvari and Islam, {Mohammad Tariqul}",
year = "2014",
month = "4",
day = "21",
doi = "10.1371/journal.pone.0095425",
language = "English",
volume = "9",
journal = "PLoS One",
issn = "1932-6203",
publisher = "Public Library of Science",
number = "4",

}

TY - JOUR

T1 - Extending birthday paradox theory to estimate the number of tags in RFID systems

AU - Shakiba, Masoud

AU - Jit Singh, Mandeep Singh

AU - A Sundararajan, Elankovan

AU - Zavvari, Azam

AU - Islam, Mohammad Tariqul

PY - 2014/4/21

Y1 - 2014/4/21

N2 - The main objective of Radio Frequency Identification systems is to provide fast identification for tagged objects. However, there is always a chance of collision, when tags transmit their data to the reader simultaneously. Collision is a timeconsuming event that reduces the performance of RFID systems. Consequently, several anti-collision algorithms have been proposed in the literature. Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular of these algorithms. DFSA dynamically modifies the frame size based on the number of tags. Since the real number of tags is unknown, it needs to be estimated. Therefore, an accurate tag estimation method has an important role in increasing the efficiency and overall performance of the tag identification process. In this paper, we propose a novel estimation technique for DFSA anti-collision algorithms that applies birthday paradox theory to estimate the number of tags accurately. The analytical discussion and simulation results prove that the proposed method increases the accuracy of tag estimation and, consequently, outperforms previous schemes.

AB - The main objective of Radio Frequency Identification systems is to provide fast identification for tagged objects. However, there is always a chance of collision, when tags transmit their data to the reader simultaneously. Collision is a timeconsuming event that reduces the performance of RFID systems. Consequently, several anti-collision algorithms have been proposed in the literature. Dynamic Framed Slotted ALOHA (DFSA) is one of the most popular of these algorithms. DFSA dynamically modifies the frame size based on the number of tags. Since the real number of tags is unknown, it needs to be estimated. Therefore, an accurate tag estimation method has an important role in increasing the efficiency and overall performance of the tag identification process. In this paper, we propose a novel estimation technique for DFSA anti-collision algorithms that applies birthday paradox theory to estimate the number of tags accurately. The analytical discussion and simulation results prove that the proposed method increases the accuracy of tag estimation and, consequently, outperforms previous schemes.

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

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

U2 - 10.1371/journal.pone.0095425

DO - 10.1371/journal.pone.0095425

M3 - Article

C2 - 24752285

AN - SCOPUS:84899686026

VL - 9

JO - PLoS One

JF - PLoS One

SN - 1932-6203

IS - 4

M1 - e95425

ER -