Performance Comparison of Binary Search Tree and Framed ALOHA Algorithms for RFID Anti-Collision

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• The Institute of Electronics, Information and Communication Engineersの論文
• 2008-04-01

著者

• Chen Wen-tzu

  Institute Of Telecommunications Management National Cheng Kung University

関連論文

• An Efficient Anti-Collision Method for Tag Identification in a RFID System(Wireless Communication Technologies)
• Performance Comparison of Binary Search Tree and Framed ALOHA Algorithms for RFID Anti-Collision

スポンサーリンク