一种基于B+树的RFID抗冲突算法
n Anti-collision Algorithm in RFID Based on B+ TREE
标签冲突是射频识别（RFID）技术的常见问题，冲突率是影响标签识别性能的重要因素，如何有效的减少冲突的发生对于RFID系统来说是至关重要的。本文针对二进制树形算法集合分裂速度慢、标签分裂不均匀问题，提出一种基于B+树的RFID抗冲突算法，将冲突集合分裂成一个3阶的B+树，同时利用Hash函数促使集合均匀分裂。仿真实验表明，B+算法减少了标签冲突的发生，缩短了标签识别延时，提高了识别性能。
Collision is a familiar problem in a Radio Frequency Identification(RFID). Collision rate is the crucial issue that affects the identify of tags . How to reduce collision is very vital to the whole RFID system . But the main disadvantage of Binary Tree Protocol is the rate of splitting is slow and the splitting is not uniformity .In this paper, an improved anti-collision algorithm based on B+ tree was proposed in order to solve this problem, meanwhile it 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
李仁发、 罗娟、汪云飞
通信无线通信
RFID 抗冲突算法 B+树 Hash
anti-collision RFID B+ tree hash
李仁发, 罗娟,汪云飞.一种基于B+树的RFID抗冲突算法[EB/OL].(2008-07-25)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/200807-494.点此复制
评论