| RFID (Radio Frequency Identification) is an automatic identification technology which has been developed from 1980's. It makes the identification through contactless duplex communication via microwave. Because of the maturity of Very Large Scale Integration, the volume and the cost of RFID device has been reduced, and it comes into practical phase.In RFID field, Tag collision is a key problem when many electric tags are identified. The key point of this paper is to improve the anti-collision algorithm and enhance the reading speed of RFID system. Now, the most frequently used algorithms are ALOHA, Binary-tree search, and Q-Selection which is specified in the EPC Global Class1 Generation2 standard. In this paper, we bring forward the dynamic and real-time process idea to improve the ALOHA algorithm. By mathematic calculation, we proved that the new dynamic and real-time algorithm has an improvement over the reading speed and capability. For the binary-tree search algorithm, we introduce the dynamic and back-track idea, and through calculation we proved that when there are many tags in the reading area the performance will be improved a lot. For the Q-Selection algorithm, we made the parameter C changeable when Q is changed, that means 0.1 |
PDF Full Text Request