| Extensive attention has been paid to Internet of Things in recent years. RFID (RadioFrequency Identification), as one of its key technologies, is a kind of make use of a wirelessradio frequency method at read machine and label of the technique. It carries on a non-contact'sdouble to deliver to the data to identify by attaining a target to exchange a purpose with data.The RFID technique has accuracy, strong ability environment, fast operate, long service life,long read distance, encrypt the label data, great capacity of data etc. many advantages.This paper first describes the composition of RFID, classification, principle, data integrityand other relevant theoretical knowledge. Then, it highlights reader anti-collision algorithm andtag anti-collision algorithm in RFID system. It focus on the random ALOHA anti-collisionalgorithm in multi-tag identification time of the collision problems, combined with the currentwidely used binary tree algorithm. It proposed a randomized algorithm in the previousimproved on the basis of the dynamic frame slotted ALOHA algorithm.Considering the problems of the system throughput, a large number of data exchange inthe sharp decline in performance is a common drawback in the frame slotted ALOHA algorithmand a pure ALOHA algorithm. Therefore, the proposed improved frame slotted ALOHAalgorithm is a combination of probabilistic algorithms and deterministic algorithms with theirrespective advantages. The probabilistic algorithm (ALOHA algorithm series) has been used inthe case of less number of tags. The deterministic algorithm (binary search algorithm series) hasbeen used in the case of a sharp increase in the number of tags over maximum numbers ofthroughput expected. Through the MATLAB platform simulation, results show that comparedto the fixed frame slotted ALOHA algorithm and the dynamic frame slotted ALOHA algorithm,the improved algorithm has a degree of advantage in the used slot and the system throughput. |
PDF Full Text Request