多时隙的二进制搜索防冲突算法  

Research on the anti-collision algorithm based on the multi-slot binary search tree algorithm

作　　者：单承赣[1] 王聪聪[1] 余春梅[1] 

机构地区：[1]合肥工业大学计算机与信息学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2009年第1期66-68,100,共4页Journal of Hefei University of Technology：Natural Science

摘　　要：针对RFID系统的标签冲突问题,文章在二进制搜索树算法和Aloha算法的基础上,提出了一种新颖的算法,在二进制树的每个节点处动态地估计标签的数量,根据标签的数量使用相应的时隙数;进一步对算法的性能进行了理论分析,并且通过仿真比较了该算法与二进制搜索树算法的性能,结果证明该算法能够有效地节约能量。In RFID systems, tag-collision is an important issue. This paper presents a novel algorithm based on the binary search tree algorithm and the Aloha algorithm. The amount of tags on each node of the binary tree is estimated dynamically, and then the number of slots is decided. This results in fewer reader queries and responses to tags and saving of energy. The performance of the algorithm is analyzed. Simulation results show that the algorithm produces significant energy saving in comparison with the binary search tree algorithm.

关 键 词：射频识别 防冲突 多时隙二进制搜索树算法 

分 类 号：TN015[电子电信—物理电子学]