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 | |
Publication status | Published - 2008 |
All Science Journal Classification (ASJC) codes
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering