• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3997-4015
• /
• 2014

Radio frequency identification (RFID) is an emerging wireless communication technology which allows objects to be identified automatically. The tag anti-collision is a significant issue for fast identifying tags due to the shared wireless channel between tags and the reader during communication. The EPCglobal Class-1 Generation-2 which uses Q algorithm for the anti-collision is widely used in many applications such as consumer electronic device and supply chain. However, the increasing application of EPCglobal Class-1 Generation-2 which requires the dynamic environment makes the efficiency decrease critically. Furthermore, its frame length (size) determination and frame termination lead to the suboptimal efficiency. A new anti-collision algorithm is proposed to deal with the two problems for large-scale RFID systems. The algorithm has higher performance than the Q algorithm in the dynamic environment. Some simulations are given to illustrate the performance.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.24-28
• /
• 2008

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. Among the existing anti-collision algorithms, static framed slot allocation algorithm is very simple. But when the number of tags is variable, its performance degrades because of the fixed frame size. This paper proposes an optimal frame size allocation scheme that determines the frame size. The proposed scheme is based on the number of collision slots at every frame. According to the simulation results, the tag identification time is faster that of SFSA.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.851-862
• /
• 2004

RFID(Radio frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio wave. The multi-tag identification problem is the core issue in the RFID and could be resolved by the anti-collision algorithm. However, most of the existing anti-collision algorithms have a problem of heavy implementation cost and low performance. In this paper. we propose a new tree based memoryless anti-collision algorithm called a collision tracking tree algorithm and presents its performance evaluation results obtained by simulation. The Collision Tracking Tree algorithm proves itself the capability of an identification rate of 749 tags per second and the performance evaluation results also show that the proposed algorithm outperforms the other two existing tree-based memoryless algorithms, i.e., the tree-walking algorithm and the query tree algorithm about 49 and 2.4 times respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.885-893
• /
• 2008

In RFID system, reader collision happened when multiple readers try to read the tags at the same time. Because reader collision reduces tag recognition performance, it is required for RFID system to have reader anti-collision algorithm. In this paper, we propose reader anti-collision algorithm based on hierarchical structure, where a master reader controls the slave readers to avoid the reader collisions. It is verified through simulations that the proposed algorithm enhances the performance in terms of leader collision probability and tag reading time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.2
• /
• pp.202-207
• /
• 2013

RFID technology is applied to port logistics applications since it monitors objects wirelessly without line of sight and constructs ubiquitous system with low cost. Changes of stock status in the warehouse environment make the technology more important for managing such frequent storing and un-storing. Although the RFID has beneficial characteristics of low cost and low complexity, simultaneous responses of RFID tags cause tag identification collision due to absence of elaborate medium access control scheme. Several algorithms have been proposed to overcome the tag collision problem. However, it is difficult to adopt the methods to the logistics systems that has varying loads since there was no consideration on RFID tag's mobility. Therefore, we propose an efficient RFID tag anti-collision protocol, and simulation results demonstrate performance improvement by using the proposed scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2643-2648
• /
• 2012

In the RFID Sytem, When leaders recognize the tag, a anti-collision scheme is an important factor in the performance of the system. Probabilistic-based anti-collision scheme using the slot status is a technique to estimate the number of tags. the schemes to quickly and accurately estimate the number of tags has been a lot of research. However, A initial number tag are not considering in the number of tags unknown environment. In the paper, estimation scheme for the initial number of tag is proposed to solve the problems. we analyze the performance by the initial number of tag and the proposed scheme.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.1
• /
• pp.46-53
• /
• 2008

This paper presents a 13.56 MHz RFID reader that can be used as a door-lock system for smart home security. The RFID reader consists of a transmitter, a receiver, and a data processing block. To verify the operation of the developed RFID reader, we present both a PSPICE simulation for transmitter/receiver and a digital simulation for data processing block. In particular, a CRC block for error detection of received data and a Manchester decoding block for position detection of collided data are designed using VHDL. In addition, we applied a binary search algorithm for multi-tag anti-collision. The anti-collision procedure is carried out by PIC microcontroller on software. The experimental results show that the developed reader can provide the right multi-tag recognition.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.1-9
• /
• 2010

In recent year, the cores of ubiquitous environment are sensor networks and RFID systems. RFID system transmits the electronic information of the tag to the reader by using RF signal. Collision happens in RFID system when there are many matched tags, and it degrades the tag identification performance. Such a system needs algorithm which is able to arbitrate tag collision. This paper suggests a hybrid method which reduces collision between the tags, and can quickly identify the tag. The proposed method operates based on certainty, which takes an advantage of tree based algorithm, and to reduce collision it selects transmission time slot by using tag ID. The simulation results show the suggested method has higher performance in the number of queries and collision compared to other tree based and hybrid algorithms.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.1
• /
• pp.98-104
• /
• 2012

In RFID Systems, collisions between multiple tags frequently arise due to simultaneous responses from multiple tags using the same communication channel. Most of anti-collision protocols such as QT regard these collisions as useless cycles, thereby wasting the channel bandwidth. In this paper, we propose a new anti-collision protocol, namely ASP (Adjustable splitting by patterns of collisions) protocol that utilizes the patterns collision for noticeable performance enhancements.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.806-811
• /
• 2006

In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to as anti-collision algorithm. Among the existing anti-collision algorithms, SFSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. This paper proposes a new anti-collision algorithm called DFSA which determines the optimal frame size using the number of collided slots at every frame. According to the simulation results, the tag identification time of the proposed algorithm is faster than that of SFSA.