Research On Query Tree Anti-collision Algorithm In Perception Layer Of Internet Of Things Based On RFID

Along with the Internet of things vigorously promoted and the mature of theapplication, radio frequency identification (RFID) as one of the core technology of IOTcauses attention to boom again. RFID is a non-contact automatic identification technology,the radio frequency signal using space coupling realizes the wireless two-way informationtransmission between readers and tags, so as to achieve the purpose of automaticidentification. RFID has strong penetrability, large capacity, long service life, high safety,the entire identification process without human intervention, multi-objective tagrecognition, strong environment adaptability etc, the non-contact mode of communicationout of the physical contact, like mechanical or optical contact,make it more concise andconvenient to operate.Specific research contents and innovative work is as follows:1. This paper introduces the concept of Internet of things, development history, EPCarchitecture, and analyzes the current problems and development prospects of Internet ofthings, points out that radio frequency identification technology as one of the keytechnologies in Internet of things plays an important position. And then analyzes the RFIDsystem composition and working principle for detailed.2. This paper researches on collision algorithm in radio frequency identificationsystem, including the reader collision and tag collision on two aspects, analysis of theperformance characteristics of classic tag anti-collision algorithm, and the performance ofthe algorithm is validated by simulation tools.3. A query tree algorithm is improved for a waste of slot and command redundantproblem of the certain query tree anti-collision algorithm. The improved algorithm can bedivided into two parts: the tag length simplified part and collision recognition part. In the taglength simplified part, we cut the UID information length down of the tag by the detection ofcollision bits produced in the first identification round. As a result, the request command andtag response data length, which is required between the tags and reader is reduced. In collisionrecognition part, the collision bit is found by a collision detection method, simplify the readercommand in the query tree algorithm, reduce the quantities of the communication databetween tag and reader, improve the system efficiency as a result.4. In this paper, a novel queue tag collision algorithm is promoted, which avoids thetraditional algorithm in the complex collision process, using innovative hybrid readingmode to tags for identification and the promoted anti-collision algorithm has a certain convenience in some special circumstances, such as the library shelves management andthe supply chain management applications, which have a fixed label groups.Finally, verify the superiority of the proposed algorithm through the simulationplatform of Matlab. For the improving query tree algorithm, analyze read and write timesand amount of communication data performance comparing with the query tree algorithm;For queue tag anti-collision algorithm, taking the numbers of reader sends the querycommand communications, extending to tag recognition rate as three performance indexesto carry on the analysis comparison with the basic binary tree search algorithm. Simulationresults show that the improved algorithm on the corresponding performance indicators canget some level of improvement, have a certain advantage.