RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재

    충돌 정보와 m-bit인식을 이용한 적응형 RFID 충돌 방지 기법 = Adaptive RFID anti-collision scheme using collision information and m-bit identification

    한글로보기

    https://www.riss.kr/link?id=A103034776

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
    • 오류접수

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.
    번역하기

    RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own op...

    RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

    더보기

    참고문헌 (Reference)

    1 김수철, "수동형 RFID 태그 충돌방지 알고리즘에 관한 비교 연구" 3 (3): 163-177, 2010

    2 Daniel W. Engels, "The Reader Collision Problem" Auto-ID Center 2001

    3 J. Myung, "Tag-splitting: adaptive collision arbitration protocols for RFID tag identification" 18 (18): 763-775, 2007

    4 김태훈, "RFID 태그 충돌 방지 기법들에 대한 성능 비교" 한국자료분석학회 9 (9): 3139-3149, 2007

    5 김정환, "RFID 시스템에서 비트변화감지를 이용한 하이브리드충돌 방지 프로토콜" 한국인터넷정보학회 10 (10): 133-141, 2009

    6 K. Finkenzeller, "RFID Handbook : Fundamentals and Applications in Contactless Smart Cards and Identification" John Wiley & Sons 206-219, 2003

    7 J. H. Choi, "Query tree-based reservation for efficient RFID tag anti-collision" 11 (11): 85-87, 2007

    8 G. Bagnato, "Performance analysis of anti-collision protocols for RFID systems" 1-5, 2009

    9 Jongmin Shin, "Multiple RFID tags Identification with M-ary Query tree search scheme" 17 (17): 604-607, 2013

    10 M. A. Bonuccelli, "Instant collision resolution for tag identification in RFID networks" 5 (5): 1220-1232, 2007

    1 김수철, "수동형 RFID 태그 충돌방지 알고리즘에 관한 비교 연구" 3 (3): 163-177, 2010

    2 Daniel W. Engels, "The Reader Collision Problem" Auto-ID Center 2001

    3 J. Myung, "Tag-splitting: adaptive collision arbitration protocols for RFID tag identification" 18 (18): 763-775, 2007

    4 김태훈, "RFID 태그 충돌 방지 기법들에 대한 성능 비교" 한국자료분석학회 9 (9): 3139-3149, 2007

    5 김정환, "RFID 시스템에서 비트변화감지를 이용한 하이브리드충돌 방지 프로토콜" 한국인터넷정보학회 10 (10): 133-141, 2009

    6 K. Finkenzeller, "RFID Handbook : Fundamentals and Applications in Contactless Smart Cards and Identification" John Wiley & Sons 206-219, 2003

    7 J. H. Choi, "Query tree-based reservation for efficient RFID tag anti-collision" 11 (11): 85-87, 2007

    8 G. Bagnato, "Performance analysis of anti-collision protocols for RFID systems" 1-5, 2009

    9 Jongmin Shin, "Multiple RFID tags Identification with M-ary Query tree search scheme" 17 (17): 604-607, 2013

    10 M. A. Bonuccelli, "Instant collision resolution for tag identification in RFID networks" 5 (5): 1220-1232, 2007

    11 정승민, "FQTR : RFID 시스템을 위한 새로운 하이브리드 태그 충돌 방지 프로토콜" 한국정보과학회 36 (36): 560-570, 2009

    12 H. Vogt, "Efficient object identification with passive RFID tags" 98-113, 2002

    13 C. Law, "Efficient Memoryless Protocol for Tag identification" 2000

    14 "EPC Tag Data Standard 1.6"

    15 Jae-Ryong Cha, "Dynamic Framed Slotted ALOHA Algorithms using Fast Tag Estimation Method for RFID System" 2 : 768-772, 2006

    16 Xiaolin Jia, "An Efficient Anti-Collision Protocol for RFID Tag Identification" 14 (14): 1014-1016, 2010

    더보기

    동일학술지(권/호) 다른 논문

    동일학술지 더보기

    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2027 평가 재인증평가 신청대상 (재인증)
    2021-01-01 등재 등재학술지 유지 (재인증) KCI등재
    2018-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2015-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2013-11-05 학술지명변경 외국어명 : Journal of Korean Society for Internet Information -> Journal of Internet Computing and Services KCI등재
    2011-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2009-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2006-01-01 등재 등재학술지 선정 (등재후보2차) KCI등재
    2005-01-01 등재 등재후보 1차 PASS (등재후보1차) KCI등재후보
    2003-01-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.55 0.55 0.63
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.64 0.6 0.85 0.03
    더보기

    이 자료와 함께 이용한 RISS 자료

    나만을 위한 추천자료

    해외이동버튼