基于RFID的二进制树形存储搜索算法的应用研究

Application Research on Search Algorithm of Binary Tree Storage Based on RFID

如何更好的在射频识别(RFID)系统中提高标签的读取效率,防止数据发送碰撞,是当前人们研究的一个热点问题.本文首先介绍了二进制搜索防碰撞算法,在此基础之上,提出了一种基于树形存储的二进制搜索算法.实验结果表明,相对于二进制搜索防碰撞算法,该算法不仅减少了时隙内数据通信量,而且提高了数据识别的服务效率,大大加强了整个系统的工作效率.

How to improve the reading efficiency better and prevent the data transmission of the tag in the radio frequency iden- tification （RFID） system is a hot issue in the current research. This paper first introduces the binary search anti -collision al- gorithm, on the basis of this, and proposes a kind of binary search algorithm based on tree storage. Compared with binary search anti - collision algorithm, the experimental results show that The algorithm not only reduces the amount of data commu- nication in time slot, but also improves the service efficiency of data recognition, and greatly enhances the efficiency of the whole system.