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

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)1168-1171
Number of pages4
JournalIEICE Transactions on Communications
VolumeE91-B
Issue number4
DOIs
Publication statusPublished - 2008

All Science Journal Classification (ASJC) codes

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

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