基于动态二进制的新防碰撞算法研究

Research on New Anti-collision Algorithm Based on Dynamic Binary

随着物联网的发展,无线射频识别技术(RFID)的普及,渐渐暴露出一些存在于实际运用过程中的问题.怎样解决碰撞(特别是多标签使用情况)是系统能够快速、准确运用的关键,也是现实运用中亟待于解决的问题.本文基于动态二进制搜索算法的机制和确定性标签算法的性能,提出碰撞位轮询算法(CQ算法).CQ算法从每次数据传输的通信量和搜索标签的迭代数的角度出发,首先对搜索命令进行优化,通过对单一位查询,减少系统查询过程和接收过程的通信量;再者优化搜索算法,通过减少搜索迭代数再次减少系统通信量,从而缩短识别时间;最后通过仿真来验证该算法在搜索次数和搜索时间上的优势.

With the development of the IOT and the popularization of the radio frequency identification { RFID }, the problems which exist in the practical application are exposed gradually. How to solve the collision { especially the multi-tag} is the key that leads a system to be used quickly and accurately, and also it is the issue that require immediately solution in practical use. This paper propo- ses a new algorithm named collision query algorithm （ CQ }, it is based on the characteristic of dynamic binary algorithm and the property of deterministic algorithm. The CQ algorithm is proposed from the perspective of each date transmission traffic and searching the iteration number of tags. Firstly, CQ optimizes the request order , and reduces the traffic in procedural of search and receive through searching the single bit ; Then CQ optimizes the search algorithm, through reducing the search iteration number to lessen the traffic again, thus shortening the recognition time; Finally, the simulation will be used to prove the advantages in search number and the search time.