RFID位屏蔽二进制搜索防碰撞算法研究

Research in binary tree anti-collision algorithm based on bit-shield in RFID system

在对基本二进制搜索树算法及其改进算法进行比较、分析的基础上,首次提出了位屏蔽搜索防碰撞算法,该算法利用"后退策略"以减少搜索的总次数;同时,利用已知信息,不发送和反馈重复信息,以减少阅读器和标签之间数据交换的比特数。该算法有效减少了命令发送的总次数和每次命令的参数长度,提高了搜索标签的效率和速度。

The elementary binary searching algorithm and some improved algorithms are compared and analyzed,and an anti-collision searching algorithm based on bit-shield is proposed for the first time.The algorithm adopts the method of ＂back mechanism＂ to decrease the total times of search,and by using known information and not sending and responding reduplicated information decreases the bits between the reader and the tags.The total times of command and the length of parameter of every command are decreased effectively,and the efficiency and speed of tags identification is improved.