• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.1
• /
• pp.83-91
• /
• 2014

The passive UHF RFID tags for item-level tagging are now explosively used in the supply chain and retail applications as they have several advantages, the two most relevant are cost and a longer read range. However, the signal interference problem between RFID tags and smart devices in real world is expected according to the smart-phone and tablet market growth together. The performance of RFID tags can be significantly less. The popular examples are the read-success rates and read range reduction. Especially, KT Corp. recently emphasized the serious signal interference at 900 MHz of LTE and old RFID frequencies through their public demonstration. By popular demands, this paper suggests the interference tolerance measurement method between the passive UHF RFID tag and the transmitted signal from a smart device. In addition, we selected three passive UHF RFID tags(Inlay) available on the market and quantitatively evaluated read range reduction results by interference signals using the PCR(Performance Change Rates) index. As a result, the LTE system is about three times as effective as the WCDMA system in terms of interference effects, and the read range performance of two RFID tags about 60 % drop.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.670-691
• /
• 2013

In RSSI-based RFID(Radio Frequency IDentification) indoor localization system, the signal path loss model of each sub-region is different from others in the whole localization area due to the influence of the multi-path phenomenon and other environmental factors. Therefore, this paper divides the localization area into many sub-regions and constructs separately the signal path loss model of each sub-region. Then an improved LANDMARC method is proposed. Firstly, the deployment principle of RFID readers and tags is presented for constructing localization sub-region. Secondly, the virtual reference tags are introduced to create a virtual signal strength space with RFID readers and real reference tags in every sub-region. Lastly, k nearest neighbor (KNN) algorithm is used to locate the target object and an error compensating algorithm is proposed for correcting localization result. The results in real application show that the new method enhances the positioning accuracy to 18.2% and reduces the time cost to 30% of the original LANDMARC method without additional tags and readers.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.34-39
• /
• 2012

Collisions between tags greatly reduce the identification speed in radio frequency identification (RFID) systems and increase communication overhead. In particular for an active RFID system, tags are powered by small batteries, and a large number of re-transmissions caused by collisions can deteriorate and exhaust the tag energy which may result in missing tags. An efficient collision-free arbitration protocol for active RFID systems is proposed in this paper. In this protocol, a new mechanism involving collision detection, collision avoidance, and fast tag access is introduced. Specifically, the pulse burst duration and busy-tone-detection delay are introduced between the preamble and data portion of a tag-to-reader (T-R) frame. The reader identifies tag collision by detecting pulses and transmits a busy tone to avoid unnecessary transmission when collision occurs. A polling process is then designed to quickly access the collided tags. It is shown that the use of the proposed protocol results in a system throughput of 0.612, which is an obvious improvement when compared to the framed-slotted ALOHA (FSA) arbitration protocol for ISO/IEC 18000-7 standard. Furthermore, the proposed protocol greatly reduces communication overhead, which leads to energy conservation.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.5
• /
• pp.797-802
• /
• 2011

RFID is recognized to technically occupy important position in ubiquitous computing environment and expected to create new markets in a variety of fields from now on. In order to generalize RFID system, it is required to solve the problem of privacy invasion and expedite lots of tags We suggest efficient RFID Tag Identification to identify tags quickly on the satisfaction with 3 security requirements of privacy protection in this paper. This methods are transferred to Grid environment through parallel analysis of Hash-Chain, and we measure performance of each nodes under the Grid environment. Then, We'll suggest SP-Division Algorithm to identify tags with each nodes and implement it in a Grid environment.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.177-184
• /
• 2008

A low loss frequency doubler operated on low power for the RFID harmonic tags is presented. Using the excellent nonlinear characteristics of the Schottky barrier diode and proper matching networks between the diode and ports, the low conversion loss of the harmonic tag is accomplished. This doubler could be used to increase the detectable distance of the conventional RFID system adopted harmonic tags.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.107-115
• /
• 2010

RFID (Radio Frequency IDentification) technology, automatic identification and data capture technologies in ubiquitous computing is an essential skill. Low-cost Radio Frequency Identification tags using memory and no physical contact due to the ease of use and maintenance of excellence are going to use expanded. However, it is possible to the illegal acquisition of the information between RFID tags and readers because RFID uses the RF signal, and the obtained information can be used for the purpose of location tracking and invasion of privacy. In this paper, we proposed the security scheme to protect against the illegal user location tracking and invasion of privacy. The security scheme proposed in this paper, using Gray Code and reduced the capacity of the calculation of the actual tags, However, it is impossible for the malicious attacker to track information because tag information transmitted from the reader is not fixed. Therefore, even if the tags information is obtained by a malicious way, our scheme provides more simple and safe user privacy than any other protection methods to protect user privacy, because not actual information but encrypted information is becoming exposed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.63-73
• /
• 2008

RFID(Radio Frequency IDentification) system is an automated identification system that basically consists of tags and readers and Back-End-Databases. Tags and Readers communicate with each other by RF signal. As a reader can identify many tags in contactless manner using RF signal, RFID system is expected to do a new technology to replace a bar-code system in supply-chain management and payment system and access control and medical record and so on. However, RFID system creates new threats to the security of systems and privacy of individuals, Because tags and readers communicate with each other in insecure channel using RF signal. So many people are trying to study various manners to solve these problems against attacks, But they are difficult to apply to RFID system based on EPCglobal UHF Class-1 Generation-2 tags. Recently, Chien and Chen proposed a mutual Authentication protocol for RFID conforming to EPCglobal UHF Class-1 Generation-2 tags. we discover vulnerabilities of security and inefficiency about their protocol. Therefore, We analyze vulnerabilities of their protocol and propose an efficient mutual authentication protocol that improves security and efficiency.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.311-315
• /
• 2007

This paper proposes a revised query tree algorithm in RFID systems. The proposed QT_ecfi algorithm revises the QT algorithm, which has a memory-less 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.

• Food Science and Preservation
• /
• v.17 no.1
• /
• pp.79-83
• /
• 2010

The study was conducted to analyze the tag reading and box recognition performance of a gate-type RFID system using the UHF band to detect containers of red pepper. The reading rate of tags attached to container boxes was higher as tags were closer to antennas and the number of antennas was increased. Under optimal conditions, the reading rate was 100% and the range of distance from a carton to an antenna was 1-4 meters. When tags were attached to two sides of a box, the reading rate was lower when the tags were attached at the front and side. This was caused by data collision problems between tags. The reading rate of tags was 71.1-77.8% and the reading rate of red pepper boxes was 97.8-100.0% when the distance between the pallet under the boxes and four units of antennas was 5 meters or less, and when tags were attached at the front and side of boxes.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.2
• /
• pp.559-569
• /
• 2010

We propose an RFID system based on range-free localization method. This method recognizes pre-determined reference tags first, and then checks within which reference tag the target tag is placed closest. It estimates target tag's position relative to the reference tag's position. We use Aging Counter to estimate the distance between reference and target tags using the read ratio of RFID tags. Practicality of the proposed method is verified by applying it to a library book locating system.