计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (8): 9-11.

• 博士论坛 • 上一篇    下一篇

基于数据库的查询树反碰撞算法

邓 晓,何怡刚   

  1. 湖南大学 电气与信息工程学院,长沙 410082
  • 收稿日期:2007-11-05 修回日期:2007-12-14 出版日期:2008-03-11 发布日期:2008-03-11
  • 通讯作者: 邓 晓

Database based query tree tag anti-collision protocol

DENG Xiao,HE Yi-gang   

  1. College of Electrical and Information Engineering,Hunan University,Changsha 410082,China
  • Received:2007-11-05 Revised:2007-12-14 Online:2008-03-11 Published:2008-03-11
  • Contact: DENG Xiao

摘要: 在查询树标签反碰撞算法中,标签除自己的ID外,不需要额外的记忆,且计算功能简单,可以有效降低射频识别系统的成本。除基本的查询树算法外,目前已有多种改进的查询树算法,但这些算法都只是利用标签发送的ID进行识别[1,2]。提出了一种利用标签数据库进一步提高识别速度的改进型算法,论文详细阐述了算法的原理和步骤,深入分析了该算法的算法复杂性和通信复杂性。理论分析和仿真表明,当标签密度小于50%时,算法可以有效减少查询次数,提高识别速度。

Abstract: With query tree tag anti-collision protocol,tags need not to have additional memory except the ID.Moreover,the only computation required for each tag is to match its ID against the binary string in the query.Except the basic query tree protocol,there are many improved protocols.All these protocols just utilize the information tags send back[1,2].This paper presents a novel anti-collision protocol which uses the database of tags to identify tags more quickly.Theoretical results and simulation demonstrate the efficiency of the protocol.