电子学报 ›› 2016, Vol. 44 ›› Issue (2): 437-444.DOI: 10.3969/j.issn.0372-2112.2016.02.027

• 学术论文 • 上一篇    下一篇

分组N叉跟踪树型RFID防碰撞算法研究

王鑫1, 贾庆轩1, 高欣1, 陈钢1, 赵兵2   

  1. 1. 北京邮电大学自动化学院, 北京 100876;
    2. 中国电力科学研究院, 北京 100192
  • 收稿日期:2014-06-20 修回日期:2014-08-21 出版日期:2016-02-25 发布日期:2016-02-25
  • 作者简介:王鑫(通信作者) 男,1986年2月生于山西省原平市,现为北京邮电大学自动化学院博士研究生,主要研究方向为信息安全、RFID防碰撞算法及RFID无线信道安全防护机制研究.E-mail:buptwxin@gmail.com贾庆轩 男,1964年7月生于山东省菏泽市,现为北京邮电大学空间机器人教育部重点实验室教授,博士研究生导师,主要研究方向为机器人学、空间机器人技术和虚拟现实技术.
  • 基金资助:

    国家重点基础研究发展规划(973)项目(No.2012CB724400);国际科技合作专项(No.2013DFG72850)

Research on Grouping N-ray Tracking Tree RFID Anti-Collision Algorithm

WANG Xin1, JIA Qing-xuan1, GAO Xin1, CHEN Gang1, ZHAO Bing2   

  1. 1. School of Automation, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2. China Electric Power Research Institute, Beijing 100192, China
  • Received:2014-06-20 Revised:2014-08-21 Online:2016-02-25 Published:2016-02-25

摘要:

针对无线射频识别(RFID,Radio Frequency Identification)标签多路访问产生的信号碰撞问题,提出了基于碰撞位跟踪的分组N叉跟踪树型RFID防碰撞算法(CBGN,Collision Bit Tracking Tree Algorthm Based on Grouping N-ray).利用极大似然位估算法(MLE,Maximum Likelihood Bit Estimation)估算应用环境下标签的数量.在MLE基础上根据标签标识(ID)将标签分配在不同分组内,并利用N叉树识别分组后的标签,CBGN算法通过分组及N叉识别两种策略相结合来降低碰撞概率及识别延时.最后,以通信复杂度为基准对不同N叉树下的最优分组系数进行了推导,从而获得最优N值及对应分组系数.理论分析和仿真实验表明,CBGN算法具有鲁棒性好和通信复杂度低的特点.

关键词: 无线射频识别, 防碰撞, N叉, 吞吐率

Abstract:

One grouping N-ray tracking tree RFID(Radio Frequency Identification) anti-collision algorithm (CBGN, Collision Bit Tracking Tree Algorthm Based on Grouping N-ray) for signals collision caused by RFID(radio frequency identification) tags multiple access of shared channel is proposed.We estimated the number of tags by the maximum likelihood bit estimation method (MLE, Maximum Likelihood Bit Estimation).Based on MLE, we allocated the set of tags into different groups through the tag identification, identified grouped tags via N-ray tree, and reduced recognition time by CBGN under combining grouping and N-ray identify.Finally, we derived the optimal grouping coefficient of different N-ray tree using the average identify tag cost time in communication link, further obtained the optimal N values and the corresponding optimalcoefficient of clusters.Our theoretical analysis and simulation results showed that CBGN algorithm had the characteristics of strong robustness and low communication complexity.

Key words: radio frequency identification, anti-collision, N-ray, throughput rate

中图分类号: