多枝查询树协议在解决射频识别碰撞问题中的应用

数据碰撞是影响射频识别(RFID)系统识别效率的主要因素。目前,常用的防碰撞算法是ALOHA算法和二进制树搜索算法,但这两类算法都还不能完全解决标签碰撞问题,尤其是当待识别的标签数量较大且标签ID序列号较长时,识别速度相当慢。为此提出一种多枝查询树协议,采用均衡不完全区组设计(BIBD)对标签ID进行编码,并用16位的BIBD码作为读写器查询前缀符号。理论分析和仿真结果表明,这种协议的性能较传统的防碰撞协议有明显改善。

The Application of Multi-branch Query Tree Protocol for RFID Collision Problem

The data collision is a primary cause of low identifying efficiency in a RFID system.Two approaches including ALOHA and binary tree algorithm are used to avoid the collision currently.However,they can't solve the collision problem completely,especially for bigger tag quantity and longer tag ID.In this paper,a multi-branch query tree protocol based on BIBD(Balanced Incomplete Block Design) is presented,and a 16-bit BIBD is used as query prefix symbols for read-write device.Theoretic analysis and computer simulation show that the capability of this protocol is improved obviously in comparison with conventional anti-collision algorithm.