基于自适应分组的帧时隙ALOHA算法在RFID中的研究

RFID利用无线射频技术来自动识别标签物品，它能快速、实时、准确地采集和处理信息。防碰撞技术是RFID系统的一项关键技术。现有的防碰撞算法可分为两类：基于ALOHA的防碰撞算法和基于二叉树的防碰撞算法。基于ALO-HA的防碰撞算法存在标签饥饿的问题；基于二进制树的防碰撞算法其算法性能受标签识别码长度的影响。文中提出了一种基于白适应分组的帧时隙ALOHA算法——AsFsA。仿真结果表明，当标签数目非常大时，该算法的防碰撞性能依然优于现有的帧时隙ALOHA算法。

Research on a Frame-slotted ALOHA Based on Adaptive Splitting Method for RFID

RFID uses wireless radio frequency technology to automatically identify tagged objects, it can be quick, real-time, accurate col lection and processing of information. The technology of anti-collision is a key point in RFID system. To avoid data collision, there are two approaches：ALOHA based algorithm and binary tree （BT} based algorithm. ALOHA-based algorithm has the tag starvation prob lem;Deterministic tree-based algorithm has the problem that their performances are influenced by the length of tag IDs. In this paper,pro- pose a ASFSA algorithm, which based on flame-slotted ALOHA algorithm and adaptive splitting method. The simulation results show that the anti-collision performance of the ASFSA algorithm outperforms that of current framed slotted ALOHA when a very large number of tags.