Research On The RFID Anti-collision Algorithm

RFID (Radio frequency Identification) system is an automatic identification technology that has been developed since 1990s.It can be widely used in all kinds of fields. RFID system has its specialty like contactless, anti-interference and recognizing multiple items simultaneously, so it becomes one of the most excellent auto-identification procedures that are widely applied in many fields.We introduce the basic theory knowledge about RFID system such as operational principle, characteristics, application environment and so on. Then, we focus on reader anti-collision and tag anti-collision algorithms, which are key technologies in application.In this paper, we research on existing algorithms for reader anti-collision and tag anti-collision, analyzing their characters and limit. Then, we put forward an algorithm base on bit-by-bit binary-tree of backtracking. It proves that the algorithm can resolve tag collisions much better than existing anti-collision mechanism through experiments. It can promote RFID applications in more fields.The new algorithm introduces strategy of backtracking with bit-by-bit transmission binary algorithm. It retains the advantage of single-bit transmission, and also avoids complete re-select when trying to select another tag after finishing a communication with a tag. In this way, it reduces the amount of data transmission, and improves the transmission efficiency.