基于锁位的奇偶分区二进制树算法

无线射频识别(radio frequency identification,RFID)是物联网的技术核心,防碰撞技术则是FRID必须面对的问题,针对二进制树算法时延较长,寻呼次数过多,效率低下的特点,在现有改进的二进制树算法基础上,提出一种奇偶区域锁位的二进制树算法.通过将寻呼区域划分为奇偶2个区域,并进行分区搜索,在每个搜索周期内,自动识别1位或2位碰撞标签,减少了寻呼次数,以提高搜索效率;采取增加锁位寻呼指令,将标签的应答位数限制在只传送发生碰撞的比特上,由于每次寻呼的时候,已经检测出的比特位无需再传输,可以减少总的传输比特数量,大大降低了传输时延,理论分析和仿真结果都表明该算法的有效性和优越性.

A bit-locking binary tree algorithm based on odd even zone

RFID technology is the core of the Internet of Things, Anti-collision technique is a key technique and research focus in the RFID system. In view of the inefficient of the binary tree algorithm with long delay and too much inquiry. This article is based on collision technology of radio frequency identification (RFID) technology. On the basis of many binary tree search algorithm existed, We present a new algorithm, which combine odd-even zone with bit-locking back off anti-collision algorithm. The inquiring area is divided into two zone, The dividing odd-even zone can improve the efficiency of search, while the bit-locking back off anti-collision algorithm can reduce transmission delay. Both theory and simulation results show the effectiveness and superiority of the algorithm.