RFID系统中预先侦测查询树防碰撞算法的改进  

Improved pre-detection query tree anti-collision algorithm in RFID system

作　　者：朱林海[1] 李鸿[1] 陈凌宇[1] 

机构地区：[1]长沙理工大学电气与信息工程学院,湖南长沙410114

出　　处：《计算机工程与设计》2014年第11期4040-4043,共4页Computer Engineering and Design

基　　金：国家自然科学基金项目(61074018)

摘　　要：针对无线射频识别(radio frequency identification,RFID)系统中的标签碰撞问题,在预先侦测四元查询树算法的基础上,提出一种改进的预先侦测查询树防碰撞算法。结合后退式搜索与八叉树询问机制,通过提取碰撞位信息来构建查询树。实验结果表明,改进的算法在通信量、碰撞时期的标签数量、阅读器的查询次数以及系统的吞吐率方面都优于BBS、PDQT算法。To solve the tag collision problem in the radio frequency identification （RFID） system, an improved pre-detection query tree anti-collision algorithm was proposed on the basis of pre-detecting the 4-ary query tree. Combining the backward search and 8-ary query trees, the query tree was constructed by extracting the collision information. The experimental results show that the improved algorithm is superior to BBS, PHQT algorithm in the aspect of communication bits, the number of tags during collision, query times and throughputs.

关 键 词：无线射频识别 查询树 八叉树询问 后退式搜索 防碰撞算法 

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