The Research For RFID Hybrid Anti-collision Algorithm

Radio Frequency Identification (RFID) has been quickly developed into a non-contact automaticidentification technology in the past two to three decades, and it initial formation of a set ofcomputer communication, network technology, radio frequency identification, sensor technology asone of the Internet Of Things industry. Now, RFID technology as a new technology and widely usedin the economic, social, national defense etc, and it has made an indelible contribution.The tag collision problem is one of the key issues in RFID systems. Firstly, the paper introduces amodel with the basic principle of the RFID system, combined with practical applications, andpointed out the significance of the tag anti-collision algorithm to improve the performance andefficiency of the system. Secondly, it researches and summarizes the typical of RFID taganti-collision algorithm at current and focuses on three types of anti-collision algorithm:Probabilistic anti-collision algorithm based on ALOHA. Deterministic anti-collision algorithmbased on Tree and Hybrid anti-collision algorithm. And typical algorithms are described, analyzedand illustrated. In the the Probabilistic algorithm, it also consider the capture effect on systemperformance, and summarizes several typical tag estimation algorithm.The paper presents an improved algorithm based on Tree–BS-BCU; it used Bit Encoding Unitto recode the collision bit information, so that the reader does not need to traverse queries, Therebyreducing the number of queries and the identification delay, so that the tags can be identifiedquickly. This paper also proposed a novel hybrid anti-collision algorithm–EQH, The algorithm isdivided into two stages-the tag estimation stage and the tag identification stage. The tag evaluationstage using novel enhanced Q parameter estimation algorithm, it use of limited slots to be able toaccurately estimate the number of tags. Tag identification stage using a special register to be able toquickly identify the tags in collision slots. EQH algorithm overcomes the problem of tag starvationin probabilistic algorithms and tag identification delay is too long in deterministic algorithm. Theproposed algorithms and performance are described in detail.in this paper. Through simulation andcomparison, there were significant improvements in the proposed algorithm in identificationefficiency.