基于三叉碰撞跟踪树的高效RFID防碰撞算法  

Effective RFID anti-collision algorithm based on 3-ary collision-track tree

作　　者：王鑫[1] 贾庆轩[1] 高欣[1] 赵兵[2] 

机构地区：[1]北京邮电大学自动化学院,北京100876 [2]中国电力科学研究院,北京100192

出　　处：《华中科技大学学报（自然科学版）》2014年第6期73-78,共6页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家重大基础研究发展计划资助项目(2012CB724400);国家国际科技合作专项资助项目(2013DFG72850)

摘　　要：通过对标签唯一标志(ID)进行进制转换并制定相应编码规则,在二叉碰撞跟踪树(2-CT)算法基础上,提出了三叉碰撞跟踪树(3-CT)算法.3-CT算法自适应调整二叉树或三叉树分割标签碰撞集,降低了搜索树整体深度,进而提高了2-CT算法识别效率.理论分析和仿真实验表明:3-CT算法有效提高了2-CT算法吞吐率,其系统识别耗时和耗能较少,当标签数量较小时,吞吐率提高了约10.53%;当标签数量级较大时,最高吞吐率趋近66%.Based on binary collision-track（2-CT）algorithm,through the hexadecimal conversion of tag′s identification,corresponding coding rules were set up,and a kind of 3-ary collision-track tree（3-CT）algorithm was put forward.The algorithm can adaptively adjust binary tree or 3-ary tree to split the collision sets of tags,and the overall depth of search tree was reduced.Hence,3-CT improved the recognition efficiency of 2-CT.Theoretical analysis and experimental simulation illustrate that the proposed algorithm have higher recognition efficiency compared to 2-CT with less time-consuming and energy-consuming.In the situation of small quantity′s tag,throughput rate is improved by about 10.53%.When identifying environment have large orders of magnitude tags,the highest throughput is close to 66%.

关 键 词：无线射频识别 防碰撞 三叉 吞吐率 时隙 

分 类 号：TN911.7[电子电信—通信与信息系统]