摘要
工业现场多标签的快速识别问题一直是RFID技术实用领域亟待解决的问题;在分析现有的各种RFID防碰撞算法特点的基础上,提出了一种适用于多标签快速识别的改进型算法;该算法在正式进行标签识别前先统计标签ID中数字"1"的总位数,并将该统计值作为分组编号对待识别标签进行分组识别,有效地减少了标签数据碰撞发生的可能性;此外,该算法中新的查询前缀是根据首位碰撞位生成,有效避免了空搜索的存在,一定程度上减少了系统识别效率受标签ID长度的影响;最后,该算法中只将标签ID中与搜索前缀相匹配之后的数据返回给阅读器,有效减少了系统通信量;仿真结果表明,该算法性能稳定,吞吐率可达65%,可以有效应用在工业现场,实现多标签的快速读取。
The problem of fast identification of industrial multi-label has always been an urgent problem in the practical field of RFID technology.On the basis of analyzing the characteristics of existing anti-collision algorithms of RFID,this paper presents an improved algorithm for fast multi-label recognition.The algorithm counts the total number of digits'1'in the label ID before formally recognizing the label,and treats the statistical value as a group number to identify the identification tag,which effectively reduces the possibility of tag data collision.In addition,the new query prefix in the algorithm is generated according to the first collision bit,which effectively avoids the existence of empty search and reduces the system recognition efficiency affected by the label ID length to some extent.Finally,the algorithm only returns the data from the tag ID matching with the search prefix to the reader,which effectively reduces the system traffic.The simulation results show that the algorithm is stable in performance and has a throughput of 65%.The algorithm can be used in industrial field effectively and realize fast reading of multiple tags.
作者
王涛
王琪
张如伟
马义飞
裴翦
Wang Tao;Wang Qi;Zhang Ruwei;Ma Yifei(Shandong Jianzhu University,Jinan 250101,China)
出处
《计算机测量与控制》
2019年第4期163-166,共4页
Computer Measurement &Control
基金
山东省重点研发计划(2016ZDJS02A12
2018GGX103042
2017CXGC0603
2018YFJH0306
2017CXGC0918
2017CXGC1505)
关键词
RFID防碰撞
查询树算法
搜索前缀
首位碰撞位
RFID collision prevention
query tree algorithm
search prefix
first collision bit