多时隙树的RFID防碰撞算法  

RFID Anti-Collision Algorithm for Multi-Slot Tree

作　　者：冯旺[1] 张磊[1] 张琨[1] 

机构地区：[1]河北工业大学控制科学与工程学院,天津300130

出　　处：《计算机仿真》2015年第8期298-301,305,共5页Computer Simulation

基　　金：河北省高等学校科学技术研究指导项目(Z2012135)

摘　　要：在RFID系统中,主要的问题来自于标签碰撞。针对目前传统算法中存在的延迟时间长、通信数据量大等问题,提出了多时隙树的RFID防碰撞算法。在算法中阅读器根据译码结果发送查询命令,标签通过查询命令选择自己所在的时隙,并在选择的时隙响应读写器。整个寻呼过程采用后退策略,即在识别出一个标签后,只需从命令堆栈中取出上一层分枝的查询命令。仿真结果表明,与传统的二叉树搜索防碰撞算法相比,RFID防碰撞算法具有较少的时间复杂度和通信复杂度,同时识别效率也得到了明显的提高。In the RFID system, the main question comes from the tag collision. In view of the problems of long recognition time and large correspondence data quantity in binary tree search algorithm, we proposed a RFID anti - collision algorithm for muhi - slot tree. The time slot concept in the algorithm was introduced. According to the re- sults of decoding the reader judge the relationship between the highest and the second highest position of the collision hit to send query commands, the tags chose the time slot through the inquiry order and response reader in the chosen time slot. The entire paging process used the back strategy, namely after distinguishing a tag, the inquiry order must be taken out from the order storehouse. The simulation result indicates that the proposed algorithm has fewer time complexity and the fewer correspondence complexity, the recognition efficiency also obtaines the distinct enhance- ment.

关 键 词：射频识别 多时隙树 时隙 防碰撞算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]