摘要
为了提高射频标签的识别速度,提出一种防碰撞改进算法ODFSA。该算法通过判断标签数量和算法门限值之间的关系,选择响应标签的数量,使其等于系统最大时隙数,直至标签数量小于算法门限后,进入DFSA算法的处理程序。计算及仿真结果证明,当标签数量为500时,该算法的效率分别是BFSA和DFSA的1.488倍和1.375倍,在标签数量较大的情况下,算法效率非常接近系统的理论值。
In order to improve identification speed of Radio Frequency（RF） tags, this paper proposes an improved anti-collision algorithm called ODFSA（Optimized Dynamic Framed Slotted ALOHA）. The algorithm judges the relationship between the number of tags and the algorithm threshold, and selects the number of responding tags which equivalents to the largest slot number of Radio Frequency Identification（RFID） system until the number is less than the threshold, and enters Dynamic Framed Slotted ALOHA（DFSA） algorithm. Simulation results show that the efficiency of ODFSA algorithm is 1.488 and 1.375 times than Basic Framed Slotted ALOHA（BFSA） algorithm and DFSA algorithm when the number of tags is 500, and the efficiency of this algorithm is very close to the theoretical value in the circumstance of the large number of tags.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第9期272-274,共3页
Computer Engineering
基金
南京电子技术研究所发展基金资助项目(03-885)
关键词
射频识别
标签识别
防碰撞
动态时隙ALOHA算法
Radio Frequency Identification（RF1D）
tag identification
anti-collision
Dynamic Framed Slotted ALOHA（DFSA） algorithm
