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

• 영문명: Anti-Collision Algorithm for Improvement of Multiple Tag Identification in RFID System
• 발행기관: 한국IT서비스학회
• 저자명: 김용환(Yong-Hwan Kim) 류명춘(Myung-Chun Ryoo) 박준호(Joon-Ho Park)
• 간행물 정보: 『한국IT서비스학회지』한국IT서비스학회지 제12권 제3호, 331~343쪽, 전체 12쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2013.09.30

영문 초록

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.

목차

Abstract

1. 서론

2. 관련 연구

3. N-ary 쿼리 트리 알고리즘

4. 알고리즘 분석

5. 성능평가

6. 결론

참고문헌

키워드

RFID Anti Collision Query Tree Algorithm