A Hybrid Anti-collision Algorithm With Id-based Grouping For RFID System

With the proposed and development of internet of things, radio frequencyidentification technology becomes very popular. With the characteristics of automaticrecognition of non-contact, long distance and multi objectives, the radio frequencyidentification technology has been applied to the military, medical, transportation,monitoring and other fields. Because of the characteristic of non-contact and recognitionof multi targets, there is a problem of information collision. the label can’t be recognizedby the reader because of the information collision, so it restraints the future developmentof radio frequency identification technology. The anti-collision problem of radiofrequency identification is an urgent problem to be solved, and it’s a hot issue in the fieldof radio frequency identification technology.The main work of the thesis is studying the anti-collision technology. Firstly, thepaper introduces some common algorithms, for example the binary-based algorithms andthe aloha-based algorithms. According to the phenomenon of different part of the ID oflabel with different meaning in reality, the paper presents an hybrid algorithm based onquery tree algorithm and dynamic frame slotted aloha algorithm. The query treealgorithm identifies tags by the ID of tags, and the dynamic frame slotted aloha algorithmhas a good result of recognition under known the number of tags, especially reduce thecollision times of tags. The simulation shows that the all slots of the hybrid algorithmequal with the dynamic frame slotted aloha algorithm when the number of tags is above1000, and the efficiency of hybrid algorithm has improved9.91%than the dynamic frameslotted aloha algorithm, and87.88%than the query tree algorithm. The paper proposes anew hybrid algorithm based on the regressive-style binary search algorithm and dynamicframe slotted aloha algorithm again. The regressive-style binary search algorithm has thecharacteristic of making full use of the ID of tag information of collision node, so that itcan reduce the identify times of the reader. What’s more, the second hybrid algorithm hasa new segment transmission mechanism of the ID of tags, it reduces a lot ofcommunication of system when there are lots of tags. By comparing the simulation result of regressive-style binary search algorithm, dynamic frame slotted aloha algorithm andthe improved hybrid algorithm, the result shows that the hybrid algorithm gives anobvious advantages in the tag collisions under not increasing the identify time of reader.The efficiency of hybrid algorithm has improved17.19%than the dynamic frame slottedaloha algorithm, and44.13%than the regressive-style binary search algorithm. The resultshows that the two hybrid algorithm are valuable in practical application.