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

发布时间：2017-12-26 23:24

本文关键词：分组N叉跟踪树型RFID防碰撞算法研究　出处：《电子学报》2016年02期 　论文类型：期刊论文

【摘要】：针对无线射频识别(RFID,Radio Frequency Identification)标签多路访问产生的信号碰撞问题,提出了基于碰撞位跟踪的分组N叉跟踪树型RFID防碰撞算法(CBGN,Collision Bit Tracking Tree Algorthm Based on Grouping Nray).利用极大似然位估算法(MLE,Maximum Likelihood Bit Estimation)估算应用环境下标签的数量.在MLE基础上根据标签标识(ID)将标签分配在不同分组内,并利用N叉树识别分组后的标签,CBGN算法通过分组及N叉识别两种策略相结合来降低碰撞概率及识别延时.最后,以通信复杂度为基准对不同N叉树下的最优分组系数进行了推导,从而获得最优N值及对应分组系数.理论分析和仿真实验表明,CBGN算法具有鲁棒性好和通信复杂度低的特点.
[Abstract]:According to the radio frequency identification (RFID Radio, Frequency Identification) signal collision of the label from the multiple access, put forward the packet collision bit tracking N binary tree anti-collision algorithm based on RFID (CBGN, Collision Bit Tracking Tree Algorthm Based on Grouping Nray). The maximum likelihood estimation method using a MLE (Maximum Likelihood, Bit Estimation the estimated number of applications) tag. On the basis of MLE according to the label (ID) to label distribution in different groups, and the use of N binary tree recognition after grouping labels, CBGN algorithm and N packet through the fork to identify two kinds of strategy are combined to reduce the collision probability and identification delay. Finally, in order to communication the complexity of the optimal packet coefficient benchmark for different N under the tree was deduced to obtain the optimal N value and the corresponding packet coefficient. Theoretical analysis and simulation results show that CBGN algorithm has robust Good character and low communication complexity.
【作者单位】：北京邮电大学自动化学院;中国电力科学研究院;
【基金】：国家重点基础研究发展规划(973)项目(No.2012CB724400) 国际科技合作专项(No.2013DFG72850)
【分类号】：TP391.44
【正文快照】： 1引言RFID(无线射频识别)作为物联网关键支撑技术,广泛应用于物流、航空及交通运输等自动识别领域[1],具有远距离识别及批量读取等诸多优点.然而,当读写器进行批量读取时,多标签同时响应致使信号碰撞,从而增加了识别延迟,阻碍了RFID系统在快速识别领域的大规模应用[2].因此,设

【相似文献】