一种基于B+树的RFID抗冲突算法

An Anti-collision Algorithm in RFID Based on B+ TREE

针对二进制树形算法冲突集合分裂速度慢、标签分裂不均匀问题,提出一种基于B+树的RFID抗冲突算法.本算法将冲突集合分裂成一个3阶的B+树,即将每次发生冲突的集合分裂成3个子集,从而加快冲突集合的分裂速度,冲突集合相当于B+树的中间节点,每个子集分别对应于一个关键码,叶子节点或只包含一个标签或为一个空集合.为了防止集合分裂的不均匀,引入合适的hash函数,使集合均匀分裂.仿真实验表明,B+算法减少了标签冲突的发生,缩短了标签识别延时,提高了识别性能.

An improved anti-collision algorithm based on B ＋ tree was proposed. In this algorithm, the collision tags split into three smaller aggregations at each round so as to quicken the rate of splitting. Collision aggre-gation corresponds to the intermediate node of the B ＋ tree. Each key corresponds to a splitted aggregation. Each leaf of the tree contains one tag or null. Meanwhile this algorithm made use of hash operation to average splitting . Simulating results show that the B ＋ algorithm reduced collision, shortened the identify delay and improve the identify performance.