• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.287-292
• /
• 2007

In this paper, a QT_ecfi algorithm is proposed for identifying all the tags within the identification range. The proposed QT_ecfi algorithm revises the QT algorithm, which has a memoryless property. In the QT_ecfi algorithm, the tag will send the remaining bits of their identification codes when the query string matches the first bits of their identification codes. When the reader receives all the responses of the tags, it knows which bit is collided. If the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. While the tags are sending their identification codes, if the reader detects a collision bit, it will send a signal to the tags to stop sending. According to the simulation results, the QT_ecfi algorithm outperforms the QT algorithm in terms of the number of queries and the number of response bits.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.164-169
• /
• 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 (Framed Slot ALOHA) 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.731-736
• /
• 2017

In this paper, we propose a simplified tag collection algorithm to improve the performances of ISO/IEC 18000-7, which is a standard for an active RFID system. The proposed algorithm modifies the collection command that enables to start a tag collection round. The modified collection command includes the results of the listen period response for the previous collection round. Tags that receive the collection command check the collision status for their responses. If there is no collision, tags transmit their additional data and go into the sleep mode without the point-to-point read command and sleep command. A collection round for the standard consists of a collection command and response, a read command and response, and sleep command. On the other hand, in the proposed algorithm, a collection round consists of a collection command and response. The simulation results showed that the proposed algorithm can improve the identification delay about 16% compared with the standard when the number of tags are 300.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.712-714
• /
• 2016

The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In this paper, we propose a STAC/PS algorithm that the PS algorithm is applied in the STAC protocol. The simulation results show that the STAC/PS algorithm can achieve faster tag identification speed compared with STAC protocol due to the low collision rate.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.267-274
• /
• 2009

For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.91-93
• /
• 2006

RFID(Radio Frequency IDentification) 기술은 RF 신호를 사용하여 물품에 부착된 전자 태그(tag)를 식별하는 비접촉자동인식 기술이다. 이런 RFID 기술의 확산을 위해서는 리더가 다수의 태그를 빠른 시간 안에 인식하는 다중 태그 식별 문제를 해결 해야만 한다. 지금까지 이 문제를 해결하기 위한 충돌 방지(anti-collision) 알고리즘이 많이 개발되었다. 본 논문에서는 이런 충돌 방지 알고리즘 중에서 18000-6 Type A, Type B와 Type C로 새롭게 채택된 EPCglobal Class1 Generation2, 그리고 Query Tree Protocol에 대한 시뮬레이션 시스템의 구조를 소개하고 실제 시뮬레이션 했을 때의 각 알고리즘에 대한 간단한 성능 평가를 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.13-19
• /
• 2012

The use of RFID is recently increasing for the realization of Ubiquitous computing. Reducing the process time of tag recognition is crucial as RFID system has to recognize multiple objects in a short amount of time. In this manuscript, therefore, an effective scheme using multi-reader is suggested to improve processing speed for tag authentication in RFID system. According to the result of performance analysis, the processing time required for tag authentication was drastically reduced in multi-reader environment than it was in a single reader. Consequently, the use of the suggested scheme cuts down on the processing time while identifying tags by using multi-reader and bring about overall performnce improvement of RFID system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.565-568
• /
• 2005

RFID system allows contactless identification of objects, where small tags are attached to objects and information of objects are transferred using radio frequency. In recent years, industries have incorporated several identification systems to its production processes, which allow collecting automatically information about goods. In order to communicate with a single tag out of a group of tags, the target tag has to be identified. Therefore the read has to attempt to obtain the unique identification code of each tag within its read range. This paper presents performance results of QT and QT-sl protocols, which are tag identification protocols incorporating memoryless property. The memoryless property is that the current response of each tag only depends on the current query of the reader but not on the past history of the reader's queries.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.5
• /
• pp.20-27
• /
• 2007

In this paper, Air-interface protocols of ISO 18000-6 Type A and B applied to RFID system in UHF band are analyzed, and those algorithms are realized. Also, the improved anticollision algorithms for the Type A and B of ISO 18000-6 protocol are proposed and the performances are compared. As the results, reduction ratio of total tag recognition time of the improved ISO 18000-6 Type A algorithm is 35.2 % for 100 tags and 24.3% for 1000 tags with respect to standard algorithm, respectively. And the reduction ratio of the improved ISO 18000-6 Type B algorithm is 6.0% for 100 tags and 6.6% for 1000 tags. Therefore, the improved anticollision algorithm proposed in this paper is the advanced method improving the performance of tag recognition in the RFID system.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.4
• /
• pp.9-19
• /
• 2008

In this paper, it is studied anti-collision algorithm based on the transmission protocol for RFID baseband system of the lSO/IEC 18000-6 Type-C regulation and designed the baseband part of RFID reader system using FPGA. To compensate this weak point of the slot random aloha algorithm which must have a long time to be dumped before deciding an appropriate slot size according to the number of surrounding tag, we suggested how to apply Bit By Bit algorithm to be able to recognize the tag when the tag is clashing. The design of the baseband part in the RFID reader system is accomplish by use of the ISE9.1i and I made an experiment on it targeting Spartan2. Construction verification is measured each block through Logic Analyzer and I can verify it has no error. I also compared and analyzed the performance between proposed algorithm and past algorithm and verified the improvement of performance.