一种新型RFID动态帧时隙ALOHA算法  

A Novel Dynamic Framed Slotted ALOHA Algorithm in RFID

作　　者：石封茶[1] 崔琛[1] 余剑[1] 

机构地区：[1]合肥电子工程学院,安徽合肥230037

出　　处：《信息与控制》2013年第5期553-559,共7页Information and Control

摘　　要：为使在射频识别系统中的标签能够被快速、高效地识别,提出了一种基于码分多址思想的动态帧时隙ALOHA防碰撞算法(CD-DFSA).首先分析了算法的设计思路,然后构造了算法的数学模型,推导出了其最优帧长和标签数目估计的表达式,最后进行了仿真实验和比较分析.结果表明,CD-DFSA算法与帧时隙ALOHA算法、动态帧时隙ALOHA算法和二进制树算法相比,系统吞吐量高且识别相同数量的标签所用时隙数少.In order to make the tags be read fleetly and efficiently in RFID system, a novel dynamic framed slotted ALOHA anti-collision algorithm based on code division multiple access （CD-DFSA） is presented. Firstly, the design ideas of the novel algorithm are analyzed, then a novel algorithm model is constructed and the expressions of the optimal frame length and the number of estimated tags are deduced. Finally, simulation and comparative analysis is presented. Simulation results show that the CD-DFSA algorithm has a higher system throughput and uses fewer time slots for reading the same number of tags compared with the frame slotted ALOHA algorithm, dynamic framed slotted ALOHA algorithm and binary-tree algorithm.

关 键 词：射频识别(RFID) 码分多址(CDMA) 动态帧时隙 ALOHA 吞吐量 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]