检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈鸿俊[1]
机构地区:[1]四川水利职业技术学院
出 处:《电子测试》2015年第12期29-31,共3页Electronic Test
基 金:四川科技厅项目编号2012GZ0112
摘 要:无线射频识别技术是一种非接触的自动识别技术,具有识别距离远、穿透能力强、多物体识别等优点,现已广泛应用于自动化、交通运输、控制管理、产品服务、证件防伪等领域。RFID系统由于信号在无线信道中相互干扰,就会发生冲突或碰撞,致使标签识别或数据采集失败,这就需要建立有效的防碰撞机制,即防碰撞算法或防碰撞协议,来协调标签与阅读器间的通信。目前,RFID防碰撞算法的研究主要集中在Aloha时隙防碰撞算法和二叉树搜索防碰撞算法。但Aloha时隙防碰撞算法存在某个标签始终无法被识别的现象;二叉树搜索算法可以避免这个问题,但当标签数量比较大时,识别周期长,影响了RFID读写器的效率。Wireless radio frequency identification technology is a non-contact automatic identification technology, which has many advantages, such as high identification distance, penetrating ability, multi object recognition, etc.,has been widely used in the field of automation, transportation, control management, product service, document security and other fields. Because of the interference of the signal in wireless channel, the RFID system has a collision or collision, which leads to the failure of tag identification or data acquisition, which requires the establishment of an effective collision avoidance mechanism, i.e.,anti collision algorithm or anti collision protocol, to coordinate the communication between the tag and the reader. At present, the research of RFID anti collision algorithm is mainly focused on the Aloha slot collision avoidance algorithm and the two fork tree search anti collision algorithm. However, the Aloha time slot collision avoidance algorithm has the phenomenon that a tag is not recognized. Two binary tree search algorithm can avoid this problem, but when the number of tags is large, the identification period is long, which affects the efficiency of RFID reader.
分 类 号:TP391.44[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7