首页 | 官方网站   微博 | 高级检索  
     

基于动态二进制的二叉树搜索结构RFID反碰撞算法
引用本文:李兴鹤,胡咏梅,王华莲,付延安,郭春花.基于动态二进制的二叉树搜索结构RFID反碰撞算法[J].山东科学,2006,19(2):51-55.
作者姓名:李兴鹤  胡咏梅  王华莲  付延安  郭春花
作者单位:1. 山东大学控制科学与工程学院,济南,250061
2. 山东劳动职业技术学院,山东,济南,250022
基金项目:教育部科学技术研究项目
摘    要:针对RFID系统中最常见的反碰撞问题,提出一种基于动态二进制的二叉树搜索结构RFID反碰撞算法,并用反证法证明整个搜索过程符合满二叉排序树结构,然后对比二进制及动态二进制算法,证明本算法的优越性,仿真结果表明本算法比已有的动态二进制反碰撞算法更具优势,而且随着标签数目与标签EPC位数的增多,优势更明显。

关 键 词:RFID反碰撞  二进制搜索  二叉树
文章编号:1002-4026(2006)02-0051-05
收稿时间:2005-10-26
修稿时间:2005年10月26

An anti-collision RFID algorithm based on binary-tree search of the dynamic binary
LI Xing-he,HU Yong-mei,WANG Hua-Lian,FU Yan'an,GUO Chun-hua.An anti-collision RFID algorithm based on binary-tree search of the dynamic binary[J].Shandong Science,2006,19(2):51-55.
Authors:LI Xing-he  HU Yong-mei  WANG Hua-Lian  FU Yan'an  GUO Chun-hua
Affiliation:1. School of Control Science and Engineering, Shandong University, Jinan 250061, China ; 2. Shandong Labor Vocation Technology college, Jinan 250022, China
Abstract:A new algorithm based on binary-tree search of Dynamic binary is presented for solving the common problem of anti-collision in RFID,it is proved by using reduction that the process of search is in accord with full binary sort tree of structure,the advantage of the algorithm is proved by compared with binary algorithm and dynamic binary algorithm.(Finally,) the results of simulation also show that the new algorithm has better performance in comparison with the existing dynamic binary algorithm,and with the increase of the tags and the length of EPC,the advantages is more obvious.
Keywords:RFID  anti-collision  binary search  binary-tree  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号