动态自适应搜索矩阵防碰撞算法研究

An dynamic anti-collision algorithm based on adaptive search matrix

提出一种动态自适应搜索矩阵防碰撞算法。新算法利用曼彻斯特编码可以准确识别碰撞位的特性获得碰撞信息,通过一定的规则构造搜索矩阵,能够逐段式搜索,并引入碰撞前缀查询机制获得准确的发送前缀,使搜索矩阵动态可变,同时使用碰撞堆栈自适应地调整搜索路径,减少碰撞时隙的同时避免了空闲时隙的产生,加快了标签的识别过程。理论分析和计算机仿真表明:新算法克服了传统的基于二叉树搜索的防碰撞算法的缺点,提高了搜索效率和系统吞吐量,具有一定的实用性。

An dynamic anti-collision algorithm based on adaptive search matrix is presented.Since readers which are using Manchester code in the RFID system can identify the position of collision bits,the novel anti-collision algorithm can get the information of collision,construct search matrix by certain rules and be able to search tag’s EPC sequence section by section.It adopts the mechanism of collision prefix query to obtain accurate sending prefix,makes the search matrix dynamic change and uses collision stack to adjust the search path adaptively.And it can also reduce collision timeslots,avoid the generation of idle timeslots and accelerate the tag identification process.Theory analysis and computer simulations show that the novel anti-collision algorithm overcomes the disadvantages of traditional anti-collision algorithms based on binary tree search.And it improves search efficiency,increases throughput of the system and has a certain degree of practicability.