• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.507-508
• /
• 2007

확률적(stochastic) RFID 충돌방지 알고리즘은 둘 이상의 태그가 리더기의 인식범위 내에 있을 경우 태그들이 동시에 리더기의 질의에 응답함으로서 발생하는 충돌을 확률적으로 감소시켜, 정확하고 빠르게 다수의 태그를 인식하기 위한 알고리즘이다. 본 논문에서는 확률적 충돌방지 알고리즘 중 하나인 dynamic framed ALOHA를 기반으로 새로운 태그 수 추정 방법을 이용한 RFID 충돌 방지 알고리즘을 제안하였다.

• 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 Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.184-194
• /
• 2005

One of the most important factors that decide the overall performance of RFID system is anti-collision algorithm. By enhancing the anti-collision algorithm, we can increase the number of RFID tags that can be processed in unit time. Two anti-collision algorithms are most widely prevailed: one is ALOHA-based protocol and the other is a binary tree walking method, but these are still under research. In this paper, we suggest an anti-collision algorithm named AAC(Address Allocating and Calling) using pre-distributed random address, which is much faster and more efficient than existing ones. Finally, we evaluate our scheme using mathematical analysis and computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.17-26
• /
• 2005

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects attached with electronic tags by using radio wave. For the implementation of an RFID system, an anti-collision algorithm is required to identify several tags within the RFID reader's range. Few researches report the performance trade-off among anti-collision algorithms in terms of the communications traffic between the reader and tags, the identification speed, and so on. In this paper, we analyze both tree based memoryless algorithms and slot aloha based algorithms that comprise of almost every class of existing anti-collision algorithms. To compare the performance, we evaluated each class of anti-collision algorithms with respect to low-cost RFID system with 96-bit EPC(Electronic Product Code). The results show that the collision tracking tree algorithm outperforms current tree based and aloha based algorithms by at least 2 times to 50 times.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.235-242
• /
• 2012

In RFID System, one of the problem that we must slove is to devise a good anti-collision algorithms to improve the efficiency of tag identification which is usually low because of tag collision. Among of the existing RFID anti-collision algorithm, BS (Binary Search) algorithm, though simple, has a disadvantage that the stage of times used to identify the tags increase exponentially as the number of tags does. In this paper, I propose a new anti-collision algorithm called Multi-collision reflected frame which restricts the number of stages and decided bit. Since the proposal algorithm keep the length size of UID and density of total tag when have 100%. The simulation results showed that the proposed algorithm improves the efficiency by 30~50% compared to the existing algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.807-812
• /
• 2015

In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred as anti-collision algorithm. In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. 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 this paper, we propose a STAC/PS algorithm that the PS algorithm is applied in the STAC protocol. Through simulations, it is demonstrated that the collision rate for the proposed algorithm is about 50% lower than STAC protocol. Therefore, the STAC/PS algorithm can achieve faster tag identification speed compared with STAC protocol due to the low collision rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.942-949
• /
• 2004

This paper proposes and analyzes the anti-collision algorithm in Ubiquitous ID system. We mathematically compares the performance of the proposed algorithm with that of binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center. We also validated analytic results using OPNET simulation. Based on the analytic results, comparing the proposed algorithm with bit-by-bit algorithm which is the best of existing algorithms, the performance of proposed algorithm is about 5% higher when the number of tags is 20, and 100% higher when the number of tags is 200.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.7
• /
• pp.611-619
• /
• 2016

This paper proposes a collision prevention system for an agricultural unmanned helicopter. The collision prevention system consists of an obstacle detection system, a mapping algorithm, and a collision avoidance algorithm. The obstacle detection system based on a LiDAR sensor is implemented in the unmanned helicopter and acquires distance information of obstacles in real-time. Then, an obstacle mapping is carried out by combining the distance to the obstacles with attitude/location data of the unmanned helicopter. In order to prevent a collision, alert is activated to an operator based on the map when the vehicle approaches to the obstacles. Moreover, the developed collision prevention system is verified through flight test simulating a flight pattern aerial spraying.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.544-552
• /
• 2003

This paper suggests an instruction code sufficiency algorithm preventing data collision when multiple transponders attempt to connect in the radio frequency identification system. Conventional time domain procedure generates unconditional collision. On the other hand, this algorithm prevents data collision by transmitting data when it meets instruction code. When multiple transponders are transmitting data coincidently, they exploit desired data with using difference of arrival time generated by recognition distance, respectively. As a result of simulation, utilizing the wireless recognition system, adopting the suggested algorithm, operating in 13.56MHz frequency band, it verify that there is Anti-collision and data loss by ensuring transmission time difference of one bit by adopting this algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.413-420
• /
• 2006

In this thesis, a RFID baseband system is implemented based on the international standard ISO/IEC 18000-6 Type-B using FPCA, and also anti-collision algorithm is implemented to improve the system performance. We compares the performance of the proposed anti-collision algorithm with that binary tree algorithm and bit-by-bit algorithm, and also validated analytic results using OPNET simulation. The proposed algorithm for Type-B transmission protocol and collision prohibition was designed using ISE7.1i which is a FPGA design-tool of Xilinx and implemented with Spartan2 chip which is a FPGA device.