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

计算机工程 ›› 2009, Vol. 35 ›› Issue (3): 279-281. doi: 10.3969/j.issn.1000-3428.2009.03.096

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

基于BIBD(4,2,1)的RFID防碰撞算法

李世煜,冯全源,鲁 飞   

  1. (西南交通大学微电子研究所,成都 610031)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-02-05 发布日期:2009-02-05

Anti-collision Algorithm Based on BIBD(4,2,1) in RFID System

LI Shi-yu, FENG Quan-yuan, LU Fei   

  1. (Microelectronic Technology Lab, Southwest Jiaotong University, Chengdu 610031)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-02-05 Published:2009-02-05

摘要: 标签防碰撞技术是射频识别系统的关键技术之一,它决定着标签的读取速率和正确率。以二进制搜索算法和平衡不完全区组设计BIBD(4,2,1)为基础,提出一种新型确定性RFID标签防碰撞算法。将标签分节,每节只包含BIBD(4,2,1)的子集,通过逐节识读达到快速识别的目的。数学分析和仿真结果表明,该算法识别速度优于二进制算法和动态二进制算法,可达到二进制算法的6倍以上,适用于标签数量多、UID长度较长的识别环境。

关键词: 射频识别, 防碰撞, 确定性算法, 标签碰撞

Abstract: Tag anti-collision is a significant issue in Radio Frequency Identification(RFID) system design, which determines the identification speed. Thus a novel anti-collision algorithm based on binary tree searching algorithms and BIBD(4,2,1) is proposed to solve this problem. Tag is divided into several sections, which only contain special sequences. Reader can efficiently get every UID by identifying sections one by one. Mathematics analysis and simulation results show that the algorithm presented improves the identification speed and outperforms the existing ones. It especially fits the identification conditions which contain more tags or tags with long UID.

Key words: Radio Frequency Identification(RFID), anti-collision, deterministic algorithm, tag-collision

中图分类号: