摘要
针对RFID系统中最常见的反碰撞问题,提出一种基于动态二进制的二叉树搜索结构RFID反碰撞算法,并用反证法证明整个搜索过程符合满二叉排序树结构,然后对比二进制及动态二进制算法,证明本算法的优越性,仿真结果表明本算法比已有的动态二进制反碰撞算法更具优势,而且随着标签数目与标签EPC位数的增多,优势更明显。
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.
出处
《山东科学》
CAS
2006年第2期51-55,共5页
Shandong Science
基金
山东省自然科学基金(Y2004G05)
