计算机工程2012，Vol.38Issue(23)：291-293,3.DOI:10.3969/j.issn.1000-3428.2012.23.073
RFID系统中改进的混合查询树防碰撞算法
Improved Hybrid Query Tree Anti-collision Algorithm in RFID System
摘要
Abstract
To solve the tag collision problem in Radio Frequency Identification(RFID) system, an improved hybrid query tree anti-collision algorithm is proposed, which adopts the method of hybrid query tree algorithm and multiple ary tree. The algorithm is based on QT algorithm, uses the tags' collision information generated by tag sequence generator, combines 8-ary query trees, avoids idle circle and compensate slot, reduces tag collisions and system consumption. The results show that, compared with QT and HQT algorithm, the proposed algorithm has lower query times and communication bits between reader and tags, and the improved hybrid query tree algorithm's identification efficiency is enhanced by 46.1% compared with HQT algorithm.关键词
无线射频识别/标签/查询树/匹配前缀/八叉树/防碰撞Key words
Radio Frequency Identification(RFID)/ tag/ query tree/ matching prefix/ 8-ary tree/ anti-collision分类
信息技术与安全科学引用本文复制引用
南敬昌,单晓艳,高明明..RFID系统中改进的混合查询树防碰撞算法[J].计算机工程,2012,38(23):291-293,3.基金项目
国家自然科学基金资助项目(60971048) （60971048）
辽宁省博士启动基金资助项目(20091033) （20091033）
