• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.139-142
• /
• 2009

RFID(Radio Frequency IDentification) technology is an automatic identification method using radio frequencies between RFID reader which collects the information and tag which transmits the information. RFID technology develops passive RFID which transmit the only ID to active RFID which transmit the additional information such as sensing information. However, ISO/IEC 18000-7 as active RFID standard has a problem which cannot use multiple channel. To solve this problem, we use the 2.4GHz bandwidth technology and we propose the dynamic channel allocation method which can efficiently allot a channel. we show the operation of the dynamic channel allocation method through design and implement with CC2500DK of Taxas Instrument.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2247-2256
• /
• 2011

In this paper, we propose a coordinator-based reader protocol that can avoid reader collisions in a passive RFID system. In a proposed protocol, unlike conventional protocols that a reader itself selects its own slot randomly to communicate with tags such as DCS, Colorwave, a coordinator reader allocates an unused slot to a reader to participate in the network and sends a current slot number. A reader allocated a slot can communicate with tags. The proposed protocol can adaptively modified to apply for multiple coordinator readers environment in a wide area. This causes reader collision problem, but can be alleviated partly by applying the frequency planning. In this way, we verifies that a RFID system using the proposed protocol is three to five times better than existing systems through the simulation.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.99-112
• /
• 2008

In the passive UHF (860-960MHz) RFID communications, which consists of a set of readers and tags, the readers normally interrogate the tag by using the backscatter mechanism. (i.e., tag response). In practical RFID environment, where multiple readers or tags exist; the interference causes collisions. This paper proposes a centralized arbitration scheme for avoiding the collision problems among multiple readers. The proposed centralized arbitration scheme is modeled in software environments, and is verified with simulation results. Simulated performance is focused on completion time, utilization and response time, and the simulation results show that our proposed scheme provides satisfactory performance grade.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.321-328
• /
• 2010

This paper presents a coordinator-based TDMA reader protocol that can avoid the reader collision in a passive RFID system. In the proposed protocol, the coordinator can not only minimize the number of empty slots by efficiently allocating slots to readers incoming in Poisson distribution, but reduce latency time through the limited frame size. The proposed protocol can be implemented in either mobile or fixed mode through the slot structure to be described in the context. The simulation results show it works as suggested and the frame size limitation as well as the statistical distribution of incoming readers has a great impact on the overall slots and the average latency time.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.201-208
• /
• 2008

An active RFID system has the advantages of a long identification distance and a good identification rate as well as overcoming the passive RFID's drawback such as the lowering of identification rate on metal materials. So, the development of an active RFID system has been gradually increasing in harbor logistics and the national defense area. On the other hand, some identification failures between products developed under the same standards have been reported, and there are difficulties in evaluating the interoperability between developed Products and standard conformance test because an accurate evaluation method and equipment has not been established at the international level. Motivated by these, this study presents a realization of the hardware and software of emulator to evaluate the standard conformance of an active RFID system, Performance of the designed system are then analyzed by means of simulations of Matlab/Simulink, and the applicability of the emulator is verified by evaluating the standard conformance of a real active RFID tag.

• Journal of Digital Convergence
• /
• v.17 no.12
• /
• pp.211-217
• /
• 2019

Location positioning systems are available in applications such as mobile, robotic tracking systems and Wireless location-based service (LBS) applications. The GPS system is the most well-known location tracking system, but it is not easy to use indoors. The method of radio frequency identification (RFID) location tracking was studied in terms of cost-effectiveness for indoor location tracking systems. Most RFID systems use active RFID tags using expendable batteries, but in this paper, an inexpensive indoor location tracking system using passive RFID tags has been developed. A pattern matching method and a system for tracing location by generating regression curves were studied to use precision tracking algorithms. The system was tested by verifying the level of error caused by noise. The three-dimensional curves are produced by the regression equation estimated the statistically meaningful coordinates by the differential equation. The proposed system could also be applied to mobile robot systems, AGVs and mobile phone LBSs.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.1
• /
• pp.8-15
• /
• 2007

This paper proposed hardware architecture of the block cryptographic algorithm HIGHT aiming small size and low power application, and analyzed its performance. The HIGHT is a modified algorithm of the Feistel. The encryption and decryption circuit were designed as one iterative block. It reduces the redundant circuit that yields small area. For the performance improvement, the circuit generates 32-bit subkey during 1 clock cycle. we synthesized the HIGHT with Hynix $0.25-{\mu}m$ CMOS technology. The proposed circuit size was 2.658 EG(equivalent gate), and its power consumption was $10.88{\mu}W$ at 2.5V for 100kHz. It is useful for a passive RFID tag or a smart IC card of a small size and low power.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.5 no.1 s.9
• /
• pp.65-70
• /
• 2006

A UHF band RFID passive tag antenna, which can be attached on metallic objects, is proposed. The proposed tag antenna is more insensitive to the size of the metallic object than conventional PIFAs or IFAs. It is constructed on a multi-layer and its size is reduced by using a 'L' slit. Performances of the antenna is analyzed by Ansoft's HFSS and measured using a back-scattering method. The simulated and measured data are obtained with varying the size of metallic object.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.483-492
• /
• 2007

In this paper, we propose a new hybrid approach based on query tree protocol to arbitrate tag collisions in RFID systems. The hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, we use a 4-ary query tree instead of a binary query tree. To reduce idle time, we introduce a slotted backoff mechanism to reduce the number of unnecessary Query commands. Simulation and numerical analysis reveal that the proposed protocol achieves lower identification delay than existing tag collision arbitration protocols.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.