全分组不等长时隙的DFSA算法

All Grouping Unequal Slot DFSA Algorithm

标签碰撞是无线射频识别技术中的常见问题,它将大大降低系统的效率,如何有效解决这个问题对整个系统来说尤其重要。首先对Aloha及其几种改进算法进行研究分析,针对目前最常用的动态帧时隙算法中标签估计和帧长调整方法存在的缺点,根据冲突问题本身,以及Aloha防冲突机制的数学特性,对识别过程进行分析,提出了一种帧长及分组数动态调整方案,减少空时隙和碰撞时隙占用时间,同时制定取舍规则,当标签数量大时,在识别初始阶段分组延迟一部分标签。仿真证明,该方案可减少标签冲突,提高识别效率。

Tag collision which makes the system less efficient in the radio frequency identification systems is a very common problem. How to solve this problem effectively is very important for the entire system. Aloha and several improved algorithms are analyzed. For the shortcomings of tag estimation and frame length adjustment method in the most commonly used dynamic frame slot algorithm, the recognition process is analyzed and a dy- namic adjustment program of frame size and packet number is proposed according to the conflict itself and the mathematical properties of Aloha anti-collision mechanism. The time that the empty slot and the collision slot can be reduced. The rules of the trade-offs are developed when the number of tags is large. A part of tags in the initial identification stage is delayed by packet. Simulation results show the improved program can reduce the tag conflicts and improve the efficiency of identification.