Research On RFID Anti-collision Algorithm Based On The Specific Encoding Mechanism

RFID(Radio Frequency IDentification) is a technology which not need to be established thedirect contact but with the optical contact between the system and the objective, identify a specifictarget with a radio signal. One of the main advantages of RFID is multi-target identification at thesame time, but there is a problem which called the tag collision. The ALOHA-based of probabilisticalgorithm had a tag hunger problem, Tag can not be identified in a limited time, although theBinary search tree algorithm has been solve this problem, but also with shortcomings of longerperiod of recognition, and the large amount of tag communication. Therefore, the main direction ofthe binary search tree algorithm focused on reduce the identify long slots and reduce the problem oftraffic.The paper has two algorithm,The first algorithm is the introduction of a new mechanism foroctree algorithm,called the block code,reader determine the specific block code and the tag’s IDwith the collision bit position directly,so as to remove the idle slots, and reamain the collisionslots be same as the original octree algorithm, the use of the block code improve effective on theoctree; the other algorithm is the introduction of the substitution code, and optimize the code. thenew mechanism maintain the performance of the original algorithm with less traffic. the Efficiencyand performance can be seen through the simulation and Mathematics, and the most of the traffic iscompleted by the reader, release tag, can effectively solve the problem of large traffic of the originalalgorithm.