Performance comparison of binary search tree and framed ALOHA algorithms for RFID anti-collision

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly affects the uplink throughput for the framed ALOHA algorithm.

Original languageEnglish
Pages (from-to)1168-1171
Number of pages4
JournalIEICE Transactions on Communications
VolumeE91-B
Issue number4
DOIs
Publication statusPublished - 2008 Jan 1

Fingerprint

Radio frequency identification (RFID)
Trees (mathematics)
Throughput
Computer simulation

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{ecce667319ca4760b814065b7cf8582b,
title = "Performance comparison of binary search tree and framed ALOHA algorithms for RFID anti-collision",
abstract = "Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly affects the uplink throughput for the framed ALOHA algorithm.",
author = "Wen-Tzu Chen",
year = "2008",
month = "1",
day = "1",
doi = "10.1093/ietcom/e91-b.4.1168",
language = "English",
volume = "E91-B",
pages = "1168--1171",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

Performance comparison of binary search tree and framed ALOHA algorithms for RFID anti-collision. / Chen, Wen-Tzu.

In: IEICE Transactions on Communications, Vol. E91-B, No. 4, 01.01.2008, p. 1168-1171.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Performance comparison of binary search tree and framed ALOHA algorithms for RFID anti-collision

AU - Chen, Wen-Tzu

PY - 2008/1/1

Y1 - 2008/1/1

N2 - Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly affects the uplink throughput for the framed ALOHA algorithm.

AB - Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly affects the uplink throughput for the framed ALOHA algorithm.

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

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

U2 - 10.1093/ietcom/e91-b.4.1168

DO - 10.1093/ietcom/e91-b.4.1168

M3 - Article

VL - E91-B

SP - 1168

EP - 1171

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 4

ER -