• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.110-116
• /
• 2008

A RFID is an automatic data collection system based on the radio frequency and is the key technology of ubiquitous computing environments. Since the locations of objects attached by RFID tags can be acquired by readers, it is possible to query the locations of tags. To query tags efficiently, the data of RFID tags should be modeled and indexed. However, since the location information of tags, the predicates of queries, are differ from coordinates of moving objects, it is difficult to model tags under the concept of moving objects, In this paper, we propose the location model of tags to represents the trajectories of tags. The location model is composed of the set and graph based approaches.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.47-52
• /
• 2008

A radio-frequency identification(RFID) tag is a small, inexpensive microchip that emits an identifier in response to a query from a nearby reader. The price of these tags promises to drop to the range of $0.05 per unit in the next several years, offering a viable and powerful replacement for barcodes. The challenge in providing security for low-cost RFID tags is that they are computationally weak devices, unable to perform even basic symmetric-key cryptographic operations. Security researchers often therefore assume that good privacy protection in RFID tags is unattainable. In this paper, we explore a notion of minimalist cryptography suitable for RFID tags. We consider the type of security obtainable in RFID devices with a small amount of rewritable memory, but very limited computing capability. Our aim is to show that standard cryptography is not necessary as a starting point for improving security of very weak RFID devices. Our contribution is threefold: 1. We propose a new formal security model for authentication and privacy in RFID tags. This model takes into account the natural computational limitations and the likely attack scenarios for RFID tags in real-world settings. It represents a useful divergence from standard cryptographic security modeling, and thus a new view of practical formalization of minimal security requirements for low-cost RFID-tag security. 2. We describe protocol that provably achieves the properties of authentication and privacy in RFID tags in our proposed model, and in a good practical sense. Our proposed protocol involves no computationally intensive cryptographic operations, and relatively little storage. 3. Of particular practical interest, we describe some reduced-functionality variants of our protocol. We show, for instance, how static pseudonyms may considerably enhance security against eavesdropping in low-cost RFID tags. Our most basic static-pseudonym proposals require virtually no increase in existing RFID tag resources.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2B
• /
• pp.263-268
• /
• 2010

This paper shows the key management system in a small metallic cabinet using a small UHF RFID tags. Each key chain with a key has a custom-designed small RFID tag antenna. There are 6 metallic racks in the small cabinet, and each rack can hold 60 key chains. Therefore, the small cabinet can hold 360 key chains with tags. The 360 key chains with RFID tags in a cabinet are recognized by RFID key chain management system. Even though it is hard to recognize 360 tags in the a cabinet, this RFID key management system with small custom designed RFID tags can recognize all the tags in the small cabinet. To read the all the tags, the locations of antennas and tag shapes are optimized. The reading rates based on the bios-version of the reader and the locations of the reader antennas are compared.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.2 s.344
• /
• pp.44-48
• /
• 2006

This study is intended to provide guidelines in establishing courses on domestic developments of chipless tags by observing status of domestic and foreign RFID tag providers, along with status of foreign manufacturers in RFID chipless tags, which is highly interested in overseas as well astechnical status of major providers. This paper introduces methods of data writing to tags, reading and decoding the data. and characteristics of tags manufactured by Inkode and RFSAW, products has been researched.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.1
• /
• pp.15-22
• /
• 2006

This paper presents an efficient localization scheme for an indoor mobile robot using RFID tags on the floor. The mobile robot carries an RFID reader at the bottom, which reads the RFID tags on the floor to localize the mobile robot. Each RFID tar on the floor stores its own absolute position which is used to calculate the position and velocity of the mobile robot. Locating the RFID tags on the floor, which constructs an intelligent sensor space, may require several factors to be considered: economics feasibility and accuracy. In this paper, the optimal allocation scheme of the RFID tags on the floor to satisfy the accuracy constraint has been proposed and verified by the experiments. Based on the RFID reading, the mobile robot navigation has been successfully demonstrated to avoid obstacles and to reach the goal within a pre-specified time.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.203-206
• /
• 2005

Recently, the RFID(Radio Frequency Identification) technology has gained significant attention. One of the performance issues in RFID systems is to resolve the tag collision among responses from RFID tags. In this paper, we proposed a new scheme for estimation of the number of tags in the reader filed. The scheme is used by anti-collision algorithm to identify multiple tags efficiently. And we also present the simulation result that shows the proposed scheme to estimate tags efficiently and also to improve the systems efficiency.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.164-169
• /
• 2009

An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA (Framed Slot ALOHA) algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.

• Korean Management Science Review
• /
• v.29 no.3
• /
• pp.1-11
• /
• 2012

This paper considers a localization problem in time difference of arrival (TDOA)-based radio frequency identification (RFID) systems. To estimate the position of a target tag, this paper suggests three localization algorithms that use benchmark tags. The benchmark tags are the same type as the target tag, but either the locations or distance of the benchmark tags are known. Two algorithms use the benchmarks for auxiliary information to improve the estimation accuracy of the other localization algorithms such as least squared estimator (LSE). The other one utilizes the benchmarks as essential tags to estimate the location. Numerical tests show that the localization accuracy can be improved by using benchmark tags especially when an algorithm using the LSE is applied to the localization problem. Furthermore, this paper shows that our benchmark algorithm is valuable when the measurement noise is large.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1797-1801
• /
• 2005

SLAM(Simultaneous localization and mapping) and AI(Artificial intelligence) have been active research areas in robotics for two decades. In particular, localization is one of the most important issues in mobile robot research. Until now expensive sensors like a laser sensor have been used for the mobile robot's localization. Currently, as the RFID reader devices like antennas and RFID tags become increasingly smaller and cheaper, the proliferation of RFID technology is advancing rapidly. So, in this paper, the smart floor using passive RFID tags is proposed and, passive RFID tags are mainly used to identify the mobile robot's location on the smart floor. We discuss a number of challenges related to this approach, such as RFID tag distribution (density and structure), typing and clustering. In the smart floor using RFID tags, because the reader just can senses whether a RFID tag is in its sensing area, the localization error occurs as much as the sensing area of the RFID reader. And, until now, there is no study to estimate the pose of mobile robot using RFID tags. So, in this paper, two algorithms are suggested to. We use the Markov localization algorithm to reduce the location(X,Y) error and the Kalman Filter algorithm to estimate the pose(q) of a mobile robot. We applied these algorithms in our experiment with our personal robot CMR-P3. And we show the possibility of our probability approach using the cheap sensors like odometers and RFID tags for the mobile robot's localization on the smart floor.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.469-474
• /
• 2009

An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.