• Information and Communications Magazine
• /
• v.25 no.10
• /
• pp.7-17
• /
• 2008

RFID 시스템은 유통물류 분야를 비롯해 다양한 분야에서 활용되고 있지만, RFID 시스템에서의 태그 및 리더 충돌로 인해 태그의 인식효율 및 인식속도의 감소가 RFID시스템의 확산에 걸림돌이 되고 있다. 본고에서는 RFID 시스템의 효율을 높이기 위한 태그 및 리더 충돌방지 알고리즘들을 소개한다. 특히, ISO 18000-6 Type C 수동형 RFID 시스템에서의 태그 및 리더 충돌방지 알고리즘에 대하여 집중적으로 알아본다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.11
• /
• pp.1211-1216
• /
• 2007

Yagi-Uda UHF RFID(Radio Frequency Identification) tag antennas with long reading range have been designed. According to ISO-18000, EIRP(Effective Isotropic Radiation Power) of reader and reader antenna is limited as 36 dBm. Therefore, the gain of a tag antenna should be high enough to extend the reading range. Yagi-Uda antenna has been applied to a UHF RFID tag antenna, and high gain and long reading range have been achieved. Three different of Yagi-Uda UHF antennas have been optimized to achieve the small size with low back-lobe patterns. The sizes, reading ranges and return loss of Yagi-Uda tag antennas are compared and measured.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.5
• /
• pp.450-459
• /
• 2009

RFID technologies, which allow collecting, storing, processing, and tracking information by wirelessly recognizing the inherent ID of object through an attached electronic tag, have a variety of application areas. One of the important parameters in designing such RFID systems is the read range within which the system recognizes the electronic tag. We present a novel method of designing an RFID tag required for long read range of RFID systems. The tag designed by the proposed method is battery-assisted to increase its forward-link read range and simultaneously, has backscattering modulation amplified to increase its reverse-link read range. We experimentally confirm that the minimum threshold power of the tag is - 23 dBm and the backscattering modulation gain is 28 dB, which is consistent with our simulation results. We also verify that the tag in this paper improves more than 2 times in terms of the read range compared to the existing commercial tags.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1444-1451
• /
• 2009

This paper first proposes diverse C determining models in the Q algorithm which is proposed in the EPCglobal C1 Gen 2 standard and then compares and analyzes its performance. EPCglobal C1 Gen 2 standard proposes the slot-count (Q) selection algorithm for multiple tag identification environment, but there is no such definition for the C value which modifies the Q value depending on collision or no reply. During the tag anti-collision process, the Q algorithm adds C to the Q when there is a collision and reduces the Q by C when there is no reply. The modified Q value updates new slot-counts for tags which determines the tag identification speed, so the C value is an important factor. However, many researches only intend to increase the tag identification speed by proposing a new method or modifying the Q algorithm without any research about the C value. This paper suggests diverse C models which satisfies the EPCglobal C1 Gen 2 and analyzes their performance in the multi tag identification environment. The result of this paper can be used as an index for future researches on EPCglobal C1 Gen 2 C models and multiple tag identification performance.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.420-427
• /
• 2006

An RFID system is an important technology that could replace the traditional bar code system changing the paradigm of manufacturing, distribution, and service industry. An RFID reader can recognize several hundred tags in one second. Tag identification is done by tags' random transmission of their IDs in a frame which is assigned by the reader at each round. To minimize tag identification time, optimal frame size should be selected according to the number of tags. This paper presents new query optimization methods in RFID systems. Query optimization consists of tag number estimation problem and frame length determination problem. We propose a simple yet efficient tag estimation method and calculate optimal frame lengths that minimize overall query time. We conducted rigorous performance studies. Performance results show that the new tag number estimation technique is more accurate than previous methods. We also observe that a simple greedy method is as efficient as the optimal method in minimizing the query time.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.389-396
• /
• 2009

In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.

• 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 프로토콜보다 이진트리 프로토콜을 사용할 것을 제안한다.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.255-261
• /
• 2008

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio frequency. In RFID system, the reader needs the anti collision algorithm for fast identifring all of the tags in the interrogation zone. This Paper proposes the tree based TPAE(Tag Prediction Algorithm using Extra bit) algorithm to arbitrate the tag collision. The proposed algorithm can identify tags without identifring all the bits in the tag ID. The reader uses the extra bit which is added to the tag ID and if there are two collided bits or multiple collided bits, it checks the extra bit and grasps the tag IDs concurrently. In the experiment, the proposed algorithm had about 50% less query iterations than query tree algorithm and binary search algorithm regardless of the number of tags and tag ID lengths.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.6-12
• /
• 2004

Identification rate and time are very important in the identification of RFID tag, and the tag requires simple structure to use economically large quantity of tags. These factors make the MAC protocols of wired or wireless network environment result in different requirements. In the paper, we propose a method to apply spread spectrum scheme using orthogonal channel via Walsh function as the anti-collision communication system for the purpose of non-collision identification of multiple tags, and consider its property. The proposed system use two step identification. in the first step, collision is resolved via constructing to respond after specific delay time based on unique n, and conventional polling scheme follows in the second step.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1943-1949
• /
• 2010

In this paper, we developed a RFID tag antenna using one-sheet inlay pattern which consist of two different frequencies in one layer. The antenna in one-sheet inlay RFID tag does not use different kind RFID antennas in a card but implement 13.56MHz and 900MHz RFID tag antennas in one sheet. In order to evaluate the usability of proposed method, we configured test equipments and designed 6 different patterns and test the recognition distance of each pattern. Among the one-sheet inlay RFID tag antenna designs, the pattern no.5 has good performance with recognition distance of 5.34m at 900MHz and 3.5m at 13.56MHz.