Based On The Collision Time Slot Collision Algorithm Research

With the use and the promotion of the of RFID technology, requirements fromcommunity are also getting higher and higher about the UHF RFID system with highrecognition rate, low leakage rate and high throughput characteristics. The study aboutthe algorithm brings a ray of hope for solving the above problems. Nowadays,anti-collision algorithm in RFID system is mainly divided into two categories:probabilistic anti-collision algorithms and deterministic anti-collision algorithm. Theanti-algorithm that ISO/IEC18000-6C protocol uses is a kind of probabilisticanti-collision algorithms.Under the premise that the probability of identifying the collision tags exits,thispaper puts forward two new anti-collision algorithms for the tag number of known andunknown respectively.The recognition rate reaches the highest when the tag number isequal to the frame size in the dynamic ALOHA anti-collision algorithm.Under thepremise that the number of tags prior and the number of tags read in each polling cycleare known,we can set the frame size as the number of unread tags to get the highestrecognition.By Matlab simulation,this anti-collision algorithm increases by25%thandynamic ALOHA anti-collision algorithm. When the number of tags is unknown prior,we can estimate the number of tags to set the frame size by Chebyshev inequality. Therecognition in this anti-collision algorithm increases about53%and the recognition timedecreases about28%by formulas and Matlab simulation.The two new anti-collision algorithms are all based on the fact that it is possible toidentify the collision tags. Based on this fact, the tag recognition rate increases greatly.So in the follow ISO/IEC18000-6C protocol, only by identifying the collision tags canwe decrease the leakage read rate even eliminate the leakage read rate and increasecognition rate to promote the use of UHF RFID system.