基于多叉树搜索算法改进的RFID防碰撞算法  

An improved anti-collision algorithm based on multi-tree search in RFID

作　　者：林伟[1] 李景霞[1] 叶林锋[1] 

机构地区：[1]广东工业大学计算机学院,广东广州510006

出　　处：《电子技术应用》2013年第2期130-133,共4页Application of Electronic Technique

基　　金：国家自然科学基金(61173046);广东省部产学研结合项目(2010B090400183);广州市黄埔区科技计划项目(1130)

摘　　要：多标签碰撞问题严重影响了RFID系统的性能。为了更好地解决这一问题,提出了基于多叉树搜索的防碰撞算法。该算法根据碰撞位的不同来动态选择二叉树搜索和四叉树搜索,并引用堆栈存储查询命令以避免重复搜索和冗余搜索,使得在大批量标签的情况下,系统吞吐率大幅度提高。Multi-tags collision seriously affect the performance of RFID systems,in order to better solve this problem, this paper presents the anti-collision algorithm based on the multi-branch tree search and selects binary tree search and quad tree search algorithm based on the different dynamics of the collision bits,it also references the stack to store query commands to avoid duplication and redundance of search,making the system throughput greatly improve in the case of very large number of tags.

关 键 词：RFID 防碰撞算法 二叉树搜索 四叉树搜索 堆栈 

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