计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (5): 229-231.DOI: 10.3778/j.issn.1002-8331.2009.05.067

• 工程与应用 • 上一篇    下一篇

改进的RFID二进制搜索防碰撞算法

江 岸1,伍继雄2,黄生叶1,李曾妍3,何怡刚4   

  1. 1.湖南大学 计算机与通信学院,长沙 410082
    2.中国电子科技集团 第七研究所,广州 510310
    3.湖南人文科技学院,湖南 娄底 417000
    4.湖南大学 电气与信息工程学院,长沙 410082
  • 收稿日期:2008-01-14 修回日期:2008-04-23 出版日期:2009-02-11 发布日期:2009-02-11
  • 通讯作者: 江 岸

Improved RFID binary search anti-collision algorithm

JIANG An1,WU Ji-xiong2,HUANG Sheng-ye1,LI Zeng-yan3,HE Yi-gang4   

  1. 1.School of Computer and Communication,Hunan University,Changsha 410082,China
    2.NO.7th Research Institute,China Electronics Technology Group Corporation,Guangzhou 510310,China
    3.Department of Computer Science,Hunan Institute of the Humanities,Science and Technology,Loudi,Hunan 417000,China
    4.College of Electrical and Information Engineering,Hunan University,Changsha 410082,China
  • Received:2008-01-14 Revised:2008-04-23 Online:2009-02-11 Published:2009-02-11
  • Contact: JIANG An

摘要: 标签冲突是射频识别技术(RFID)不可避免的问题,在ABS算法和动态调整二进制搜索算法的基础上提出了一种改进的二进制搜索算法,该算法简化了阅读器发送的指令和冲突检测过程,并采用动态方式传输EPC数据。仿真结果表明,相比于目前的二进制搜索算法,这种算法能极大地减少阅读器与标签之间的通信量,有效地提高标签的识别速度,具有良好的应用前景。

关键词: 射频识别技术, 防碰撞算法, 二进制搜索, Manchester编码

Abstract: Tags collision is an unavoidable problem in RFID.This paper proposes an improved binary-tree anti-collision algorithm for Radio Frequency Identification system,The proposed algorithm combines the advantages of ABS(Adaptive Binary Splitting) algorithm and dynamic adjustment binary-tree algorithm,simplifies reader sent instructions and conflict detection process.Furthermore,the EPC data is transmitted dynamically.The performance of the proposed algorithm is simulated and compared with other binary-tree anti-collision algorithms.The simulated results show that the proposed algorithm can greatly reduced the number of bits transferred between the reader and the tags and get much better performance for identifying a large amount of tags.Therefore the application has good prospects.

Key words: Radio Frequency Identification(RFID), anti-collision algorithm, binary search, Manchester