• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.19-25
• /
• 2012

In evaluating the performance of RFID systems, the tag anti-collision arbitration has been considered to be an important issue. For BT(Binary Tree) and ABS( Adaptive Binary Splitting) protocols, the so-called capture effect, which presumably happens frequently in the process of readers' receiving messages from multiple tags, can lead to some failures in detecting all tags in BT and ABS. In this paper, we propose a new anti-collision protocol, namely FTB (Feedback TagID with Binary splitting), which can solve the aforementioned problem and improve the performance.

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

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

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1493-1498
• /
• 2012

RFID technology plays an important role in building a ubiquitous environment. As RFID tags are widely used, it is necessary to enhance the performance of massive tag writes. A tag write tends to fail since it is performed through the weak radio wave communication. In this paper, we propose a write scheme that to enhance the performance of massive RFID tag writes. In proposed scheme, tag writes performed in parallel by multiple readers connected to a middleware. Write operations are distributed among readers and tags are written in groups. We show that proposed scheme can increase the success ratio of massive tag writes through experimental tests.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1A
• /
• pp.41-48
• /
• 2011

This paper proposes an efficient code acquisition scheme for direct-sequence spread spectrum (DSSS) based real-time locating systems (RTLS). The proposed scheme employs multiple bit integration to significantly decrease false alarms when no packet signal is transmitted and increase the detection probability when the RTLS tags are excited. The performance of the proposed code acquisition scheme is analyzed and numerically evaluated, and compared with those of single-dwell and traditional double-dwell code acquisition schemes. The simulation results show that the proposed multiple-bit integration scheme outperforms single-dwell and double-dwell schemes.

• The Korean Journal of Malacology
• /
• v.30 no.2
• /
• pp.155-163
• /
• 2014

Serpins are a group of proteins involved in the regulation of serine and other type of proteases, and have been identified in many kinds of organisms from invertebrates to vertebrates. Serpins are known to regulate the proteolytic cascades of the innate immune pathways in addition to their roles in blood coagulation, angiogenesis, fibrinolysis, inflammation and tumor suppression. In this study, we have isolated two partial serpin gene fragments from expressed sequence tags (ESTs) of Nesiohelix samarangae. Dotplot analysis indicates that they are of two different types, Ns-serpin type 1 and Ns-serpin type 2. Ns-serpin type 1 has 819 bp coding region (272 amino acids), whereas Ns-serpin type 2 has 555 bp coding region (185 amino acids). Molecular phylogenetic analysis shows that the identified serpins have high similarities to their counterparts in the California see slug, Aplysia californica. Yet, the precise biological and immunological roles of these Ns-serpins remain to be further investigated using RNA interference and other molecular techniques.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.111-121
• /
• 2014

In this paper, we propose tree-based hybrid query tree architecture utilizing time slot. 4-Bit Pattern Slot Allocation(4-SL) has a 8-ary tree structure and when tag ID responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to extract the location and the number of collided bits. Also, this algorithm can recognize multiple Tags by single query using 4 fixed time slots. The architecture allows the reader to identify 8 tags at the same time by responding 4 time slots utilizing the first bit($[prefix+1]^{th}$, F ${\in}$ {'0' or '1'}) and bit pattern from second ~ third bits($[prefix+2]^{th}{\sim}[prefix+3]^{th}$, $B_2{\in}$ {"00" or "11"}, $B_1{\in}$ {"01" or "10"}) in tag ID. we analyze worst case of the number of query nodes(prefix) in algorithm to extract delay time for recognizing multiple tags. The identification delay time of the proposed algorithm was based on the number of query-responses and query bits, and was calculated by each algorithm.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.25-33
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the 4-Bit Pattern Slot Allocation(4-BPSA) algorithm for the high-speed identification of the multiple tags. The proposed algorithm is based on the tree algorithm using the time slot and identify the tag quickly and efficiently through accurate prediction using the a slot as a 4-bit pattern according to the slot allocation scheme. Through mathematical performance analysis, We proved that the 4-BPSA is an O(n) algorithm by analyzing the worst-case time complexity and the performance of the 4-BPSA is improved compared to existing algorithms. In addition, we verified that the 4-BPSA is performed the average 0.7 times the query per the Tag through MATLAB simulation experiments with performance evaluation of the algorithm and the 4-BPSA ensure stable performance regardless of the number of the tags.

• The Journal of Society for e-Business Studies
• /
• v.18 no.2
• /
• pp.223-240
• /
• 2013

RFID(Radio Frequency Identification) is use of an RFID tag applied to object for the purpose of identification and tracking using radio waves. Recently, it is being actively researched and introduced in logistics and manufacturing. RFID portals in supply chains are meant to identify all the tags within a given interrogation zone. Hence the hardware and software mechanisms for RFID tag identification mostly focus on successful read of multiple tags simultaneously. Such mechanisms, however, are inefficient for determining moving direction of tags, sequence of consecutive tags, and validity of the tag reads from the viewpoint of workflow. These types of problems usually cause many difficulties in RFID portal implementation in manufacturing environment, there by having RFID-system developers waste a considerable amount of time. In this research, we designated an RFID portal system with SDO(Sequence, Direction, and Object-flow)-perception capability by using fundamental data supplied by ordinary RFID readers. Using our work, RFID system developers can save a great amount of time building RFID data-capturing applications in manufacturing environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.358-364
• /
• 2007

RFID, Radio Frequency Identification, technology is a contactless automatic identification technology using radio frequency. For this RFID technology to be widely spread, the problem of multiple tag identification, which a reader identifies a multiple number of tags in a very short time, has to be solved. Up to the present, many anti-collision algorithms have been developed in order to solve this problem, and those can be largely divided into ALOHA based algorithm and tree based algorithm. In this paper, two new anti-collision algorithms combining the characteristics of these two categories are presented. And the performances of the two algorithms are compared and evaluated in comparison with those of typical anti-collision algorithms: 18000-6 Type A, Type B, Type C, and query tree algorithm.