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

计算机工程 ›› 2010, Vol. 36 ›› Issue (20): 241-243. doi: 10.3969/j.issn.1000-3428.2010.20.084

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

不定长RFID标签反碰撞识别算法

李 慧,张治国   

  1. (中山大学信息科学与技术学院,广州 510275)
  • 出版日期:2010-10-20 发布日期:2010-10-18
  • 作者简介:李 慧(1987-),女,硕士研究生,主研方向:RFID,模型验证;张治国,副教授
  • 基金资助:
    中山大学实验教学研究基金资助项目

Anti-collision Identification Algorithm for Unfixed-length RFID Tags

LI Hui, ZHANG Zhi-guo   

  1. (School of Information Science and Technology, Sun Yat-Sen University, Guangzhou 510275, China)
  • Online:2010-10-20 Published:2010-10-18

摘要: 射频识别技术中存在标签冲突问题,通常采用定长标签的反碰撞识别方法来解决。针对不定长标签的反碰撞识别,设计一种对RFID标签进行识别的高效二进制树形反碰撞算法——U-算法。模拟实现的测试与分析结果表明,U-算法具有二进制树形算法的优点,能达到41.67%的系统识别效率。

关键词: 射频识别, 不定长标签, 反碰撞算法, 二进制树

Abstract: Tag collision problem is a key issue in Radio Frequency Identification(RFID) system. The efficient algorithms for solving this problem usually deal with fix-length of tag encoding. For solving this problem with unfixed-length of tag encoding, a fast anti-collision algorithm called U-algorithm is presented. The U-algorithm is also of the advantages of binary tree algorithms. Simulation implementation experiments show that the proposed algorithm has the efficient identification ratio of 41.67%.

Key words: Radio Frequency Identification(RFID), unfixed-length tags, anti-collision algorithm, binary tree

中图分类号: