RFID系统防碰撞中的二进制矩阵搜索  

Binary-matrix Search in Anti-collision of RFID System

作　　者：邓辉舫[1] 刘金桥[2] 

机构地区：[1]华南理工大学计算机科学与工程学院,广州510006 [2]华南理工大学软件学院,广州510006

出　　处：《微计算机信息》2009年第29期4-5,3,共3页Control & Automation

摘　　要：针对现有的RFID防碰撞算法效率不高的问题,本文提出了一种二进制矩阵搜索算法,并用图示的方式与其它改进的后退式二进制树形搜索算法进行了比较分析,得出该算法在与类二进制搜索算法比较时,无论标签较多还是较少,效率都有很大提高;与后退式二进制树形搜索、动态调整等算法在标签较多(超过1000个)时相比,运行效率也有显著的提高。该算法不仅提高了运行效率,而且描述过程形象易懂,在RFID领域有较好的应用前景。In this paper a binary-matrix search algorithm is proposed to tackle the problem of inefficiency of the existing anti-collision algorithm. And comparisons are made between this algorithm and other algorithms. The results show that the efficiency of the binary-matrix search algorithm has been greatly improved within the whole range of tag numbers Particularly when the number of tags reaches 1000 or more, the improvement of the efficiency is great, compared to back-binary tree search algorithm and dynamic adjustment algorithms In summary, The binary-matrix search algorithm is not only improved in efficiency, but also the description of its process is easy to understand, and its application prospects are bright in RFID systems.

关 键 词：二进制矩阵搜索 射频识别 防碰撞 树形搜索 

分 类 号：TN92[电子电信—通信与信息系统]