• Title/Summary/Keyword: Anti-collision 알고리즘

Search Result 107, Processing Time 0.023 seconds

Performance Comparison and Analysis of DFSA and Binary Tree Protocol for RFID Tag Anti-Collision in Error-Prone Environment (에러가 있는 환경에서 RFID 태그 충돌을 해결하기 위한 DFSA와 이진트리 프로토롤의 성능 비료 및 분석)

  • Eom, Jun-Bong;Lee, Tae-Jin
    • Proceedings of the KIEE Conference
    • /
    • 2007.10a
    • /
    • pp.493-494
    • /
    • 2007
  • RFID (Radio Frequency IDentification) 시스템에서 수동 태그의 낮은 전송 파워 때문에 리더는 태그와의 통신시 많은 에러를 경험하게 된다. 이것은 리더가 태그의 정보를 빠르고 정확하게 인식하는 것을 어렵게 만든다. 따라서, 이러한 문제를 해결하기 위해 에러에 강한 알고리즘을 개발하고 적용할 필요가 있다. 리더가 태그의 정보를 인식하기 위해 사용하는 대표적인 프로토콜에는 ALOHA 기반의 DFSA (Dynamic Framed-Slotted ALOHA) 프로토콜과 트리 기반의 이진트리 프로토콜이 있다. 기존의 두 프로토콜 중 DFSA는 에러가 없을 때 이진트리 보다 성능이 우수하나, 에러가 존재할 때, 이진트리 보다 약 35% 정도 에러의 영향을 많이 받는 성질을 보인다. 본 논문에서는 에러가 있는 환경과 없는 환경에서의 DFSA와 이진트리 프로토콜의 성능을 분석하고, 시뮬레이션을 이용하여 이 논문에서의 성능 분석 방법이 타당함을 증명한다. 그리고 에러가 많은 환경에서는, 빠른 RFID 태그 인식을 위해 DFSA 프로토콜보다 이진트리 프로토콜을 사용할 것을 제안한다.

  • PDF

Dynamic Frame Size Allocation Scheme based on Estimated Number of Tags (태그수추정에 기반한 동적 프레임 크기 할당 기법)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.3
    • /
    • pp.469-474
    • /
    • 2009
  • An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.

Enhanced Q-Algorithm for Fast Tag Identification in EPCglobal Class-1 Gen-2 RFID System (EPCglobal Class-1 Gen-2 RFID 시스템에서 고속 태그 식별을 위한 개선된 Q-알고리즘)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.3
    • /
    • pp.470-475
    • /
    • 2012
  • In Q-algorithm of EPCglobal Class-1 Gen-2 RFID system, the initial value of $Q_{fp}$, which is the slot-count parameter, is not defined in the standard. And the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not determined. Therefore, if the number of tags is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to allocate the optimal initial $Q_{fp}$ through the tag number estimation and select the weight based on the slot-count size of current query round.

An Anti-Collision Algorithm with 4-Slot in RFID Systems (RFID 시스템에서 4 슬롯을 이용한 충돌방지 알고리즘)

  • Kim, Yong-Hwan;Kim, Sung-Soo;Ryoo, Myung-Chun;Park, Joon-Ho;Chung, Kyung-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.12
    • /
    • pp.111-121
    • /
    • 2014
  • In this paper, we propose tree-based hybrid query tree architecture utilizing time slot. 4-Bit Pattern Slot Allocation(4-SL) has a 8-ary tree structure and when tag ID responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to extract the location and the number of collided bits. Also, this algorithm can recognize multiple Tags by single query using 4 fixed time slots. The architecture allows the reader to identify 8 tags at the same time by responding 4 time slots utilizing the first bit($[prefix+1]^{th}$, F ${\in}$ {'0' or '1'}) and bit pattern from second ~ third bits($[prefix+2]^{th}{\sim}[prefix+3]^{th}$, $B_2{\in}$ {"00" or "11"}, $B_1{\in}$ {"01" or "10"}) in tag ID. we analyze worst case of the number of query nodes(prefix) in algorithm to extract delay time for recognizing multiple tags. The identification delay time of the proposed algorithm was based on the number of query-responses and query bits, and was calculated by each algorithm.

The Medium Access Scheduling Scheme for Efficient Data Transmission in Wireless Body Area Network (WBAN 환경에서 효율적 데이터 전송을 위한 매체 접근 스케줄링 기법)

  • Jang, EunMee;Park, TaeShin;Kim, JinHyuk;Choi, SangBan
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.2
    • /
    • pp.16-27
    • /
    • 2017
  • IEEE 802.15.6 standard, a Wireless Body Area Network, aims to transfer not only medical data but also non-medical data, such as physical activity, streaming, multimedia game, living information, and entertainment. Services which transfer those data have very various data rates, intervals and frequencies of continuous access to a medium. Therefore, an efficient anti-collision operations and medium assigning operation have to be carried out when multiple nodes with different data rates are accessing shared medium. IEEE 802.15.6 standard for CSMA/CA medium access control method distributes access to the shared medium, transmits a control packet to avoid collision and checks status of the channel. This method is energy inefficient and causes overhead. These disadvantages conflict with the low power, low cost calculation requirement of wireless body area network, shall minimize such overhead for efficient wireless body area network operations. Therefore, in this paper, we propose a medium access scheduling scheme, which adjusts the time interval for accessing to the shared transmission medium according to the amount of data for generating respective sensor node, and a priority control algorithm, which temporarily adjusts the priority of the sensor node that causes transmission concession due to the data priority until next successful transmission to ensure fairness.

Backward Channel Protection Method For RFID Tag Security in the Randomized Tree Walking Algorithm (랜덤화된 트리워킹 알고리즘에서의 RFID 태그 보안을 위한 백워드 채널 보호 방식)

  • Choi Wonjoon;Roh Byeong-hee;Yoo S. W.;Oh Young Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5C
    • /
    • pp.415-421
    • /
    • 2005
  • Passive RFID tag does not have its own power, so it has very poor computation abilities and it can deliver signals in very short range. From the facts, most RFID Tag security schemes assumed that the backward channel from tags to a reader is safe from eavesdropping. However, eavesdroppers near a tag can overhear message from a tag illegally. In this paper, we propose a method to protect the backward channel from eavesdropping by illegal readers. The proposed scheme can overcome the problems of conventional schemes such as randomized tree walking, which have been proposed to secure tag information in tree-walking algorithm as an anti-collision scheme for RFID tags. We showed the efficiency of our proposed method by using an analytical model, and it is also shown that the proposed method can provide the probability of eavesdropping in some standardized RFID tag system such as EPCglobal, ISO, uCode near to '0'.

Ship Detection Using Background Estimation of Video and AIS Informations (영상의 배경추정기법과 AIS정보를 이용한 선박검출)

  • Kim, Hyun-Tae;Park, Jang-Sik;Yu, Yun-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.12
    • /
    • pp.2636-2641
    • /
    • 2010
  • To support anti-collision between ship to ship and sea-search and sea-rescue work, ship automatic identification system(AIS) that can both send and receive messages between ship and VTS Traffic control have been adopted. And port control system can control traffic vessel service which is co-operated with AIS. For more efficient traffic vessel service, ship recognition and display system is required to cooperated with AIS. In this paper, we propose ship detection system which is co-operated with AIS by using background estimation based on image processing for on the sea or harbor image extracted from camera. We experiment with on the sea or harbor image extracted from real-time input image from camera. By computer simulation and real world test, the proposed system show more effective to ship monitoring.