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

Wen Tzu Chen

doi:10.1093/ietcom/e91-b.4.1168

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

Wen Tzu Chen

Institute of Telecommunications Management

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	1168-1171
Number of pages	4
Journal	IEICE Transactions on Communications
Volume	E91-B
Issue number	4
DOIs	https://doi.org/10.1093/ietcom/e91-b.4.1168
Publication status	Published - 2008

All Science Journal Classification (ASJC) codes

Software
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1093/ietcom/e91-b.4.1168

Fingerprint Dive into the research topics of 'Performance comparison of binary search tree and framed ALOHA algorithms for RFID anti-collision'. Together they form a unique fingerprint.

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 = "Chen, {Wen Tzu}",

year = "2008",

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

}

TY - JOUR

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

AU - Chen, Wen Tzu

PY - 2008

Y1 - 2008

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

AN - SCOPUS:62349088830

VL - E91-B

SP - 1168

EP - 1171

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 4

ER -