改进型的二进制搜索RFID系统反碰撞算法

Improved binary search anti-collision algorithm in RFID system

在射频识别(Radio Frequency Identification,RFID)系统中碰撞是一个很常见的问题。如何有效地解决这一问题对于RFID系统来说是至关重要的。包括跳跃式动态树形反碰撞算法在内的二进制搜索反碰撞算法是一种重要的解决碰撞问题的算法,但是这一算法有一个缺点就是标签的识别码的识别速率较低。为此提出一种改进型的反碰撞算法。和其他现存的算法相比,能够大大减少阅读器问询的次数,同时信息吞吐量可以进一步提高,算法模拟结果表明,当标签数目为100时,其吞吐量提高幅度为29.85%。

Collision is a familiar problem in a Radio Frequency IDentification （RFID） system. How to solve this problem effectively is very vital to the whole RFID system. Binary search algorithm including anti-collision algorithm based on jumping and dynamic searching is a very important anti-collision algorithm to solve the collision problems. But the main disadvantage of any existing algorithm based on binary search algorithm is the rate of identifying the identification codes （IDs） of tags is low. In this paper, an improved anti-colllsion algorithm was proposed in order to solve this problem. By using this algorithm the number of request commands can be reduced greatly, meanwhile the message handling capacity can be improved. Simulation results show that an improvement of 29.85 percent can be achieved through this algorithm when the number of tags is 100.