Regular Section
Performance Comparison of Binary Search Tree and Framed ALOHA Algorithms for RFID Anti-Collision
2008 年 E91.B 巻 4 号 p. 1168-1171
詳細
2008 年 E91.B 巻 4 号 p. 1168-1171
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.
