Computer Engineering and Applications ›› 2013, Vol. 49 ›› Issue (4): 129-133.

Previous Articles     Next Articles

Improved binary tree anti-collision algorithm in RFID system

HOU Shengyu1, FENG Feng1   

  1. 1.School of Math. and Computer Science, Ningxia University, Yinchuan 750021, China
    2.Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, China
  • Online:2013-02-15 Published:2013-02-18

一种改进的二叉树型RFID防碰撞算法

侯胜宇1,冯  锋1,2   

  1. 1.宁夏大学 数学计算机学院,银川 750021
    2.东华大学 旭日管理学院,上海 200051

Abstract: This paper describes the characteristics of radio frequency identification technology and its application prospects. Analysis and comparison of the deterministic algorithm in the current RFID system are done for the collision bit information after each detection. It proposes a method using binary tree structure to handle the collision bit. Through mathematical analysis and simulation, the algorithm has a great improvement in the amount of labels transmitted and the number of reader queries. To solve the problem of collisions in the RFID system it provides a new way of thinking.

Key words: Radio Frequency Identification(RFID), anti-collision algorithm, coding scheme, binary tree

摘要: 介绍了射频识别技术特点和应用前景,对目前RFID系统中确定性算法进行了分析与比较。针对每次探测得到的碰撞位信息,提出了一种利用构造二叉树来处理碰撞位的方法。通过数学分析与仿真,算法在标签传输数据量和阅读器查询次数上有很大改进;为解决RFID系统中的碰撞问题提供了新的思路。

关键词: 射频识别, 防碰撞算法, 编码方案, 二叉树型