• Journal of IKEEE
• /
• 제25권1호
• /
• pp.32-36
• /
• 2021

This paper presents a novel collided tag signals's periodic characteristic based radio frequency identification (RFID) tag collision detection method for the ultra high frequency (UHF) RFID. The proposed method utilizes that periodicity of tag signals is maintained even under tag collision. In the proposed method, the correlation between received signal and reference edge signal is used. Simulation result shows that the detection performance using the proposed method is about 10 dB better than that of existing method. In addition, the detection performances with different magnitude difference, phase difference, delay, number of tags are analyzed.

• The Journal of the Korea Contents Association
• /
• 제15권8호
• /
• pp.9-17
• /
• 2015

One of RFID features is that each RFID tag has a unique identifying code. Logistic System utilizes RFID tag as location tracing, understanding stock or etc. On the other hand, there is a problem of overall lower recognition rate by getting the information of non-mobility tags with no need for reading. To solve this problem, we trace and analyze variation of moving and moveless RFID tag sensitivity by the hour. In analyzed data, we verify that tag sensitivity of mobile RFID is gradually increase while non-mobility tag has same intensity value. In order to detect mobile tag, we generate a function using Matlab with analyzed data and separate moving tags from non-mobility tags by software. As a result, we can confirm that non-mobility tags are detected by software and recognition rate of RFID tag is improved by separating moveless tag.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제15권1호
• /
• pp.195-202
• /
• 2011

RFID(Radio Frequency IDentification) is a system to identify objects and its usage is being extended to distribution, healthcare, and air&port etc. RFID is a contactless system environment, and reducing tag authentication time is important because multiple tags are identified at the same time. Studies about RFID system so far is, however, mostly to improve security vulnerability in the tag authentication process. Therefore, this paper suggests an efficient scheme to decrease the time of tag authentication which is also safe for the security of tag authentication process. The proposed scheme cuts down on the tag ID search time because it searches only the classified relevant ID in the database, which is one of many components of RFID system, by using identification bits for tag ID search. Consequently, the suggested scheme decreases process time for tag ID authentication by reducing the processing time and the load of the database. It also brings performance improvement of RFID system as it improves the energy applicability of passive tag.

• The KIPS Transactions:PartD
• /
• 제16D권1호
• /
• pp.1-10
• /
• 2009

One of major purposes of a RFID system is to track moving objects using tags attached to the objects. Because a tagged object has both location and time information expressed as the location of the reader, we can index the trajectory of the object like existing spatiotemporal objects. More efficient tracking may be possible if a spatiotemporal trajectory can be formed of a tag, but there has not been much research on tag trajectory indexes. A characteristic that distinguishes tags from existing spatiotemporal objects is that a tag creates a separate trajectory in each reader by entering and then leaving the reader. As a result, there is a trajectory interruption interval between readers, in which the tag cannot be located, and this makes it difficult to track the tag. In addition, the point tags that only enter and don't leave readers do not create trajectories, so cannot be tracked. To solve this problem, we propose a tag trajectory index called TR-tree (tag trajectory R-tree in RFID system) that can track a tag by combining separate trajectories among readers into one trajectory. The results show that TR-tree, which overcomes the trajectory interruption superior performance than TPIR-tree and R-tree.

• Journal of Navigation and Port Research
• /
• 제32권5호
• /
• pp.363-368
• /
• 2008

This paper presents a miniaturization design technique of radio frequency identification (RFID) tag antenna operated in 910 MHz band. Miniaturization structure design for a tag antenna is performed by structure application of the folded dipole and meander line. In order to realize the maximum power transmission, imaginary part of a chip impedance and a tag antenna impedance is matched by complex conjugate number. The optimized tag antenna size is $50\;nm\;{\times}\;40\;nm\;{\times}\;1.6\;nm$ and its size is reduced about 62 % comparison with antenna size of reference [4]. The measured results of fabricated tag antenna are confirmed the reasonable agreement with prediction. The read range of the tag antenna with chip observed about 5 m.

• The Journal of the Korea institute of electronic communication sciences
• /
• 제2권4호
• /
• pp.199-202
• /
• 2007

In this paper, we examined the operating principle of a passive tag antenna for RFID system in UHF band. Based on the study, we proposed a novel RFID tag antenna which adopts the inductively coupled feeding structure to match antenna impedance to a capacitively loaded commercial tag chip. The proposed tag antenna consists of microstrip lines on a thin PET substrate for low-cost fabrication. The detail structure of the tag antenna were optimized using a full electromagnetic wave simulator of IE3D in conjunction with a Pareto genetic algorithm, and the size of the tag antenna can be reduced up to kr=0.27(2 cm2). We built some sample antennas and measured the antenna characteristics such as a return loss, an efficiency, and radiation patterns. The readable range of the tag antenna with a commercial RFID system showed about 1 to 3 m.

• Journal of Multimedia Information System
• /
• 제7권2호
• /
• pp.137-140
• /
• 2020

In this paper, we propose a simplified tag collection algorithm to improve the performance of ISO / IEC 18000-7, the standard of active RFID systems. In the proposed algorithm, the collection command is modified to include the result of the listening period response from the previous round. The tag, which has received the collection command, checks whether the slot to which it has responded is collided, transmits additional data to its data slot without a point-to-point read command and sleep command, and transitions to the sleep mode. The collection round in the standard consists of a series of collection commands, collection responses, read commands, read responses, and sleep commands. On the other hand, in the proposed tag collection algorithm, one collection round consists only of a collection command and a collection response. As a result of performance analysis, it can be seen that the proposed technique shows superior performance compared to the standard.

• Journal of Institute of Control, Robotics and Systems
• /
• 제16권2호
• /
• pp.158-163
• /
• 2010

In this paper, we propose the location measurement algorithm of unknown tag based on RFID (Radio-Frequency IDentification) by using RSSI (Received Signal Strength Indication) and TDOA (Time Difference of Arrival) and extended Kalman filter in smart space. To do this, first, we recognize the location of unknown tag by using the RSSI and TDOA recognition methods. Second, we set the coordinate of the tag location measured by using trilateration and SX algorithm. But the tag location data measured by this method are included complex environmental error. So, we use the extended Kalman filter in order to revise error data of the tag location. Finally, we validate the applicability of the proposed method though the simulation in a complex environment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제47권9호
• /
• pp.29-36
• /
• 2010

Consider an RFID network configured as a star such that a single reader is surrounded by a crowd of tags. In the RFID network, prior to attaining the information stored at a tag, the reader must cognize the tags while arbitrating a collision among tags' responses. For this purpose, we present a tag cognizance scheme based on framed and slotted ALOHA, which statically provides a number of slots in each frame for the tags to respond. For the evaluation of the cognizance performance, we choose the cognizance completion probability and the expected cognizance completion time as key performance measures. Then, we present a method to numerically calculate the performance measures. Especially, for small numbers of tags, we derive them in a closed form. Next, we formulate a problem to find an optimal time structure which either maximizes the cognizance completion probability under a constraint on the cognizance time or minimizes the expected cognizance completion time. By solving the problem, we finally obtain an optimal number of slots per frame for the tags to respond. From numerical results, we confirm that there exist a finite optimal number of slots for the tags to respond. Also, we observe that the optimal number of slots maximizing the cognizance completion probability tends to approach to the optimal number of slots minimizing the expected cognizance completion time as the constraint on the cognizance time becomes loose.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제33권8A호
• /
• pp.805-814
• /
• 2008

Both EPCglobal Generation-2 (Gen2) for passive RFID systems and Intelleflex for semi-passive RFID systems use probabilistic slotted ALOHA with Q algorithm, which is a kind of dynamic framed slotted ALOHA (DFSA), as the tag anti-collision algorithm. A better tag anti-collision algorithm can reduce collisions so as to increase the efficiency of tag identification. In this paper, we introduce and analyze the estimation methods of the number of slots and tags for DFSA. To increase the efficiency of tag identification, we propose two new tag anti-collision algorithms, which are Chebyshev's inequality (CHI) algorithm and hybrid Q algorithm, and compare them with the conventional Q algorithm and adaptive adjustable framed Q (AAFQ) algorithm, which is mentioned in Part I. The simulation results show that AAFQ performs the best in Gen2 scenario. However, in Intelleflex scenario the proposed hybrid Q algorithm is the best. That is, hybrid Q provides the minimum identification time, shows the more consistent collision ratio, and maximizes throughput and system efficiency in Intelleflex scenario.