作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (3): 280-283. doi: 10.3969/j.issn.1000-3428.2012.03.092

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

基于改进后退策略的按位二进制防碰撞算法

李 全   

  1. (湖北师范学院教育信息与技术学院,湖北 黄石 435002)
  • 收稿日期:2011-07-06 出版日期:2012-02-05 发布日期:2012-02-05
  • 作者简介:李 全(1982-),男,硕士,主研方向:无线射频识别,网络通信
  • 基金资助:
    湖北师范学院青年基金资助项目(2010C33)

Bit-by-bit Binary Anti-collision Algorithm Based on Improved Backtracking

LI Quan   

  1. (College of Educational Information & Technology, Hubei Normal University, Huangshi 435002, China)
  • Received:2011-07-06 Online:2012-02-05 Published:2012-02-05

摘要: 为解决无线射频识别系统中的标签碰撞问题,提出一种基于改进后退策略的按位二进制防碰撞算法。该算法利用标签ID的唯一性,使阅读器只需通过标签ID的部分比特位就能准确地识别某个标签。仿真结果表明,改进的搜索算法能减少阅读器与标签之间的识别通信量及阅读器的搜索次数,提高标签的识别速度。

关键词: 无线射频识别, 防碰撞算法, 标签识别, 二进制搜索

Abstract: In order to effectively identify an electronic tag in Radio Frequency Identification(RFID) system, a bit-by-bit binary anti-collision algorithm based on improved backtrackingthe is proposed. This algorithm takes advantage of unique feature of tag identification, and makes the reader identify a tag accurately by only parts of bits of tag identification. The experiment fully considers two important performance index of bits transferred between the reader and the tags, and the search number of reader. The analysis on simulation result indicates that the improved algorithm performs significantly better than the other binary tree algorithms. It can not only greatly reduce the bits transferred between the reader and the tags, but also reduce the search number of reader. The speed of identifying tags can be enhanced greatly. Therefore the application has good prospect.

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

中图分类号: