• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.47-54
• /
• 2005

This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(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 analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8A
• /
• pp.847-857
• /
• 2007

For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. A Bit-by-Bit algorithm is defined by Auto ID Class 0. In this paper, we propose a SBBB(Stack Bit-by-Bit) algorithm. The SBBB algorithm save the collision position and makes a query using the saved data. SBBB improve the efficiency of collision resolution. We show the performance of the SBBB algorithm by simulation. The performance of the proposed algorithm is higher than that of BBB algorithm. Especially, the more each tag bit streams are the duplicate, the higher performance is.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1159-1166
• /
• 2006

In this paper, we have designed a RFID reader receiver system for improving the performance of the passive Tag based 9$'908.5{\sim}914MHz'$ RFID reader, and analyzed the system performance according to the frequency, the reader, and tag properties. The commercial receive system causes a loss in sensitivity because of 24 capacitors and 6 inductors. So we have designed an improved system using a circulator, LNA and a SAW filter. The experimental results show that the use of a circulator to separate the Tx/Rx paths eliminates interference, the LNA improves the sensitivity of the Rx module and SAW filter eliminates the noise and spurious components in the received signal.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.505-509
• /
• 2009

Recently, many researchers have studied on RFID with the rapid development of RFID technologies. RFID adapts to many applications. A lot of readers may be deployed in some applications. The incorrect deployment of RFID readers occurs reader-to-reader interferences in many applications using RFID technologies. It causes the significant degradation of the RFID recognition rate. Therefore, it is very important to appropriately deploy the RFID readers in terms of costs and system performance. In this paper, we propose a novel RFID sensor network design system with the minimal RFID readers to cover whole regions when an arbitrary blueprint is given.

• 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.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.159-163
• /
• 2007

RFID applications are mostly associated with the timestamp when the events occur. For managing RFID data we need to design data modeling for RFID data to support monitoring and temporal queries. In this paper, we propose a temporal RFID data modeling to maintain the history of events and state changes and to monitor the states of RFID objects. This data modeling involves essential basic operations for RFID data to monitor the information of RFID objects and to support temporal queries. Filter operations can achieve better query performance and obtain efficient storage space usage. It is possible to adapt into different temporal business applications.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.712-720
• /
• 2011

Radio frequency identification (RFID) is an established technology and has the potential, in a variety of applications, to significantly reduce cost and improve performance. As RFID-enabled applications will fulfill similar tasks across a range of processes adapted to use the data gained from RFID tags, they can be considered as software products derived from a common infrastructure and assets that capture specific ions in the domain. This paper discusses a framework that supports the development of RFID-enabled applications based on a business process family model (BPFM), explicitly representing both commonalities and variabilities. To develop this framework, common activities are identified from RFID-enabled applications and the variabilities in the common activities are analyzed in detail using variation point concepts. Through this framework, RFID data is preprocessed, and thus, RFID-enabled applications can be developed without having to process RFID data. Sharing a common model and reusing assets to deploy recurrent services may be considered an advantage in terms of economic significance and the overall product quality afforded.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.517-525
• /
• 2006

In this paper, we present a high-speed RFID data filtering engine designed to carry out filtering under the conditions of massive data and massive filters. We discovered that the high-speed RFID data filtering technique is very similar to the high-speed packet classification technique which is used in high-speed routers and firewall systems. Actually, our filtering engine is designed based on existing packet classification algorithms, Bit Parallelism and Aggregated Bit Vector(ABV). In addition, we also discovered that there are strong temporal relations and redundancy in the RFID data filtering operations. We incorporated two kinds of caches, tag and filter caches, to make use of this characteristic to improve the efficiency of the filtering engine. The performance of the proposed engine has been examined by implementing a prototype system and testing it. Compared to the basic sequential filter comparison approach, our engine shows much better performance, and it gets better as the number of filters increases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1130-1137
• /
• 2006

One of the important performance issues in large-scale RFID systems is to resolve collisions among responses from RFID tags. Considering two do facto anti-collision solutions, namely the binary-tree splitting algorithm and the Slotted-Aloha algorithm, we propose to use multi-packet reception (MPR) capability to enhance the RFID tag reading rate (i.e., throughput). MPR allows an RFID reader to receive multiple reponses transmitted by tags at the same time. We analyze the effect of MPR capability in the above anti-collision algorithms, which is also validated by simulation. The analysis and simulation results show that RFID reader antenna design and signal separation techniques play an important role in improving RFID system performance with MPR capability.

• 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.