Abstract:

Aiming at the collision problem of Radio Frequency Identification(RFID) multi-tag identification system,the multi-cycle collision tree algorithm for RFID tag identification based on parity packet is proposed.It divides all the identification tags into two groups according to the parity by the sum of each tag’s bits in order to reduce the probability of collision.After making use of odd group or even group and the respond of the first bit either 0 or 1,it can be divided into two sub periods in response to reader queries.Using the feature of binary either 0 or 1 and properties of parity,two collision bits can be identified by the reader in one time.Mathematics analysis and simulation results show that the proposed algorithm can reduce the times of reader request and improve recognition efficiency,compared with Collision Tree(CT),Query Tree(QT) and Binary Search(BS) algorithms.

Key words: Radio Frequency Identification(RFID), tag collision, anti-collision, parity packet, multi-cycle, multi-tag

摘要：

针对射频识别(RFID)系统中多标签的碰撞问题,提出一种奇偶分组的多周期RFID标签碰撞树算法。根据比特位之和对标签进行奇偶分组后,判断标签同为奇组或同为偶组以及响应比特的首位为0或1,分2个子周期响应阅读器查询请求。利用二进制非0即1特征和奇偶特性,阅读器逻辑判断碰撞位数据,一次性识别两位碰撞比特位。数学分析和仿真结果表明,与传统碰撞树算法、查询树算法和二叉搜索算法相比,该算法可有效减少阅读器查询次数,提高标签识别速度。

关键词: 射频识别, 标签碰撞, 防碰撞, 奇偶分组, 多周期, 多标签

CLC Number: 

• TP301.6