摘要： 在大规模无线射频识别(RFID)电子标签应用场景中,现有的RFID防碰撞算法存在搜索时间长、数据传输量大等问题,随着标签数目的增加,算法的效率不断降低。针对上述问题,提出一种RFID电子标签防碰撞算法。采用记忆化搜索的思想,通过分析与处理标签识别数据,得到下一次标签识别的顺序与指令参数,从而快速地识别电子标签。仿真结果表明,在识别相同数量的标签时,与动态二进制算法和后退式二进制算法相比,该算法读写器寻呼次数平均减少86.37%,33.67%,读写器请求数据量平均减少85.13%,26.67%。
关键词:
电子标签,
防碰撞,
搜索算法,
识别率,
动态二进制
Abstract: In large-scale Radio Frequency Identification(RFID) application scenarios,the existing RFID anti-collision algorithm presents the disadvantages such as long search time and large amounts of data transmission,resulting in decreasing efficiency with increasing tags.Aiming at the above problems,this paper proposes a new RFID anti-collision algorithm.By analyzing and dealing with tag identification data,the order and the instruction parameters of the next tag identification are obtained,so that the electronic tag can be quickly identified.Simulation results show that while identifing the same quantity of tags,the RFID paging times are reduced by 86.37% and 33.67% on average,and the request data is reduced by 85.13% and 26.67% respectively compared with the dynamic binary algorithm and the backward binary algorithm.
Key words:
electronic tag,
anti-collision,
search algorithm,
recognition rate,
dynamic binary
中图分类号: