基于并行处理的RFID防冲突算法  

RFID Anti-collision Algorithm Based on Parallel Processing

作　　者：霍华[1] 王永杰[1] 

机构地区：[1]河南科技大学电子信息工程学院,河南洛阳471003

出　　处：《计算机工程》2011年第6期263-265,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60743008);河南省科技攻关计划基金资助项目(072302110010);河南省教育厅自然科学基础研究计划基金资助项目(2007520013)

摘　　要：为解决RFID系统中的标签碰撞问题,在分析经典二进制搜索算法的基础上,提出一种基于二进制搜索的改进算法以实现标签的快速识别。算法采用栈和队列技术、后退策略、碰撞位跟踪及并行处理思想,在碰撞处理中,读写器只需发送一个三维向量命令,标签以部分碰撞位参数为应答,减少传输数据量和识别次数;利用队列存储已识别的ID,将读写操作与碰撞处理并行,省去单独读写时间;采用模块并行处理,使读写器具有双核处理能力。测试结果表明,该算法在减少传输数据量和识别次数上优于经典二进制算法。To solve the problem of tags collision in RFID system,a new anti-collision algorithm based on classical binary-search algorithms is proposed to improve identification efficiency.In order to reduce query frequency and data interchange in the collision processing,the new algorithm adopts the techniques of stack and queue storage,back strategy,collision-bit tracking and parallel processing,etc.The algorithm can make reader only send a three-dimensional-vector order,and tags respond to the reader with some of collision-bit parameters.The algorithm utilizes the queue to store identified ID,and makes both read-write operations and collision processes work simultaneously,thus read-write time is left out.The reader has dual-core processor by using parallel processing modules.Performance result shows that this algorithm is significantly superior to the classical binary algorithms in reducing data interchange and query frequency.

关 键 词：射频识别 二进制搜索算法 后退策略 碰撞位跟踪 并行处理 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]