A Kind Of New Algorithm Of Collision In The RFID System

Radio Frequency Identification (RFID, Radio Frequency Identification) is a kindof information recognition technology by using wireless. Generally,it’s composed oftransponder, reader and the database that store the related information about ID.Itarose in the1990s’ automatic identification technology, but its development in Chinais relatively late, and there are a lot of problems still to be solved, and the collisionalgorithm has been the important research of scientific research project. RFIDcollision problem is divided into two classes, one is the reader collision between suchcollisions and it’s relatively easy to solve, the other is the collision between tags,andthe solution to this problem is relatively complex. At present, the collision of tagsalgorithm is mainly divided into two categories, one is based on the randomness ofthe collision algorithm (ALOHA algorithm), and the other is based on the traversal ofthe binary search algorithm. The advantages and disadvantages of the two algorithmsare obvious: the collision algorithm based on the ALOHA is simple, fast, but it willlose tags.Collision algorithm is based on binary,so it could find each of the tags, andit can’t lose tags, but it’s relatively complex and poor safety. Thus this paper proposesa new collision combining with algorithm. In this paper, the specific algorithmthoughts and research works are:First of all, this paper will introduce the RFID system’s working principle andbasic knowledge, make a comparative analysis of the main collision algorithm,push-out the merits and demerits of them by data simulation, and then make aforeshadowing for the new type of collision algorithm.Secondly, this paper will introduce a new thinking of collision algorithm. Usingthe frame slot algorithm in a certain environment at first, by the long-term operationcan match the time slot and tags. When the tags coming, we use frame slot algorithmto read one by one according to the time slot, once collision occurs in one or severaltime slots, then we will use the binary search algorithm,so that we can reduce theburden of the binary search algorithm in a certain extent. In this part we use theadvanced binary collision algorithm, only the collision shall be read out by rules. Itcan reduce the unnecessary redundant information, and improve the security of RFIDsystem.we can estimate the collision situation that may occur before specific operation.Using mathematical deduction and R software to push-out mathematicalexpectation. Collision algorithm of various indicators using MATLAB to simulation,and we found that the rate of the combination of new collision is nearly higher50%than the ALOHA algorithm, and it is also better than the BS and DBS algorithm, thesearch times and transmission delay are also improved. Besides，the decreasing of theburden of other transport makes the data transmission with higher security.Due to the time constraints, this paper only made out the theoretical analysis andpreliminary research algorithm. Concluded the important technical index of the RFIDsystem in collision problem,we didn’t unfold it. The RFID collision algorithm has alot of problems need to discuss and research. The problem of the security of datatransmission, and the related proof properties applicability and so on，it will be thenext focus.