RFID 시스템에서 다중 태그 인식 개선을 위한 충돌방지 알고리즘

Anti-Collision Algorithm for Improvement of Multiple Tag Identification in RFID System

In RFID systems, the anti-collision algorithm is being improved to recognize Tag's ID within recognition area of the reader quickly and efficiently. This paper focuses on Tag collision. Many studies have been carried out to resolve Tag collision. This paper proposes a new N-ary Query Tree Algorithm to resolve more than Tag collision simultaneously, according to the value of m(2~6). This algorithm can identify more tags than existing methods by treating a maximum 6 bit collision, regardless of the continuation/non-continuation Tag's ID patterns. So, it extracts maximumly different 2⁶ bit patterns per single prefix in recognition process. The performance of N-ary Query Tree Algorithm is evaluated by theoretical analysis and simulation program.