基于帧时隙二进制树的RFID标签识别方法  

Identifying RFID Tags Based on the Framed Binary Search Tree

作　　者：崔灵果[1] 肖风[1] 柴森春[1] 张百海[1] 

机构地区：[1]北京理工大学自动化学院,北京100081

出　　处：《计算机研究与发展》2013年第S2期16-22,共7页Journal of Computer Research and Development

基　　金：国家自然科学基金项目(61203144;61104086);北京市教委科学研究与研究生培养共建项目(20100639002)

摘　　要：无线射频识别(radio frequency identification,RFID)系统中的标签识别速率直接决定了系统性能,设计一个高效的标签防碰撞方法能够有效提升读写器的识别效率,并降低读写器和标签所消耗的能量.在分析已有的两类防碰撞算法性能的基础上,提出了一类融合帧时隙ALOHA思想与二进制树思想的新型防碰撞算法.4种新型算法在算法性能上稳步提升,系统能量消耗也呈递减趋势,特别适合手持式电池供能的读写器.仿真结果表明,自适应帧的二进制防碰撞算法(SA-FBS)在减少碰撞时隙上明显优于传统的防碰撞算法.The rate of identifying tags determines the performance of RFID systems directly. Designing an effective anti-collision algorithm helps improve the efficiency of identification and save energy consumption.Based on the analysis of the performance of the two kinds of existing anticollision algorithms,we present a series of new approaches which achieve less time and energy consumption especially suited for handheld readers.From the results of the simulation,we verify that the self-adaption framed binary search algorithm(SA-FBS)has the distinguished advantage contrasting with traditional anti-collision algorithms.

关 键 词：RFID 防碰撞算法 帧时隙ALOHA 二进制搜索树 

分 类 号：TP391.45[自动化与计算机技术—计算机应用技术]