Research On The Identification Efficiency Of The Passive Rfid Without Prior Information About Tags

Radio Frequency Identification(RFID) is the technique to achieve non-contact automatic identification information and two-way communication by radio frequency signal. With its continuous development, its application in the social field is widening. However, the problems of RFID is heightened, such as the collision problems of tags in the process of multiple objects identification. The leakage of tags and the misreading of tags resulted from tag collision will greatly reduce the efficiency of system identification. Therefore, to improve the efficiency of RFID system about the tag collision is one of the hotspot in the current research field. The identification efficiency of the two traditional tag anti-collision algorithms that respectively is based on the ALOHA and the type of tree protocol is low, even the efficiency of the fusion of the two above algorithms is also not high. Based on Q algorithm, the tag anti-collision in the passive RFID system is studied, and the proposed algorithm doesn’t need to estimate tags and the identification efficiency of RFID system will not be reduced in this paper.(1) In the traditional anti-collision protocol, the tag estimation is always needed, which increased the complexity of the system, and the estimation error is inevitable when estimating tags, besides, the throughput of the identification tag changes with the number of tags, which can reduce the efficiency of the system. On the basis of that, a deep research is made on anti-collision protocol of RFID system without tag estimation.(2) The traditional Q algorithm is with good robustness, but the efficiency of the system is not high. The paper is based on Q algorithm, and the thought of tree structure anti-collision is added, namely, the collision tags will be resolved by tree immediately, where the tags will be resolved by binary tree in the first collision slot, and the other collision slots will be resolved by the tree slot. The proposed algorithm is simulated with the method of MATLAB, and the experimental results are analyzed. The algorithm proposed in this paper doesn’t need to estimate tags, which reduce the complexity of the system, and avoid the problem of reducing the efficiency of the system because of no tag estimation. Besides, the proposed algorithm is with high identification efficiency of the system, and the trend is more stable. In the algorithm, the state of the current slot is judged to adjust the frame length in an adaptive way, which makes the number of tags and the frame length meet some rule, in this way, the efficiency of the system cannot be influenced by the number of tags.