一种改进的二进制防碰撞算法

AN IMPROVED BINARY ANTI-COLLISION ALGORITHM

主要针对RFID系统中标签的碰撞问题,在返回式二进制防碰撞算法的基础上提出一种改进算法。该改进算法规定当标签发生碰撞时,将被识别标签UID从最高碰撞位开始的k bit UID值,通过计算重新生成2kbit数据返回给阅读器。该数据包含了原标签的k bit UID的值的信息,使得碰撞后阅读器依然能正确识别出该值,减少了命令搜索次数。最后通过仿真与其它改进的二进制树算法做了对比,证明该算法在阅读器寻呼命令和搜寻时间上的高效性。

This paper is mainly to solve the tag collision problem in RFID system, an improved algorithm based on return binary anti- collision algorithm is proposed. This improved algorithm rules that when the collision occurs on the tag, the UID of the tag to be recognised will be returned to the reader in 2k bit data regenerated through calculation from the initial k bit UID value at the highest collision position. This bit of data contains the information of k bit UID value of the original tag, this enables the reader can still correctly recognise the value even after collision, that is to say, it will reduce the instruction-search times. Finally this algorithm is contrasted with other improved binary tree algorithms through the simulation, it proves the efficiency of the algorithm in＇search instructions and times of the reader.