计算机工程 ›› 2012, Vol. 38 ›› Issue (23): 291-292.doi: 10.3969/j.issn.1000-3428.2012.23.073

• 开发研究与设计技术 • 上一篇    

RFID系统中改进的混合查询树防碰撞算法

南敬昌,单晓艳,高明明   

  1. (辽宁工程技术大学电子与信息工程学院,辽宁 葫芦岛 125105)
  • 收稿日期:2012-03-19 修回日期:2012-05-06 出版日期:2012-12-05 发布日期:2012-12-03
  • 作者简介:南敬昌(1971-),男,教授、博士,主研方向:射频电路,多媒体信息编码,通信系统仿真;单晓艳,硕士研究生;高明明,讲师、硕士
  • 基金项目:
    国家自然科学基金资助项目(60971048);辽宁省博士启动基金资助项目(20091033)

Improved Hybrid Query Tree Anti-collision Algorithm in RFID System

NAN Jing-chang, SHAN Xiao-yan, GAO Ming-ming   

  1. (School of Electrics and Information Engineering, Liaoning Technical University, Huludao 125105, China)
  • Received:2012-03-19 Revised:2012-05-06 Online:2012-12-05 Published:2012-12-03

摘要: 针对无线射频识别(RFID)技术系统中的标签碰撞问题,采用混合查询树与多叉树结合的方法,提出一种改进的混合查询树防碰撞算法。在QT算法的基础上,通过标签序列生成器判断标签碰撞信息,结合八叉树询问机制,避免空闲周期和延迟时隙产生,减少碰撞以及标签冲突和系统开销。实验结果证明,该算法优于QT、HQT算法,可减少查询次数和系统通信量,改进的混合查询树算法的识别效率较HQT算法提高46.1%。

关键词: 无线射频识别, 标签, 查询树, 匹配前缀, 八叉树, 防碰撞

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

中图分类号: