• Title/Summary/Keyword: RFID tags

Search Result 570, Processing Time 0.029 seconds

Improving the Key Search using Parallelism in RFID Privacy Protection

  • Shin, Myeong-Sook;Kim, Choong-Woon;Lee, Joon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.2 no.1
    • /
    • pp.19-24
    • /
    • 2007
  • Abstract. In the ubiquitous environment of the next generation, RFID is predicted to occupy an important technical location and also expected to apply to various fields. However, the properties of tags in itself which is the core of RFID have a dysfunction like an invasion of privacy for user. An existing cryptanalytic protection scheme of the information leakage have a difficult problem to apply to RFID tags for privacy protection. We applied Ohkubo et al.'s scheme to the protection of the tag's information efficiently in the RFID system environment using low-cost tags. But, this method has all informations of tagsto identify tag's ID and then performs the process of identification in sequence in the Back-end server. These processes have lots of computations so that it have problems about a scalability. In this paper, we are based on Ohkubo et al.'s scheme to solve problems, and then analyze the parallelism with the Hellman's tradeoff method, divide it into nodesin parallel. In this paper, we are based on Okubo et al.'s scheme to solve problems, and then analyze the parallelism with Hellman's tradeoff method, divide it into the ${\omega}$ node in parallel. as a result, we can reduce the computing complexity of key search to $O(\frac{m^{2/3}n^{2/3}}{\omega})$ seconds from O(mm) seconds. finally we show the results to be enhanced the scalability.

  • PDF

Development of Gate Type RFID System Using UHF Band for Food and Agricultural Products Logistics (농식품 물류관리를 위한 UHF 대역의 게이트형 RFID 시스템 개발)

  • Kim, J.H.;Jeong, J.W.;Kwen, K.H.;Kang, J.S.
    • Journal of Biosystems Engineering
    • /
    • v.33 no.3
    • /
    • pp.204-209
    • /
    • 2008
  • The power strength of electric wave of reader looked radiation forms from the gate type RFID system. The more distant from antennas, the weaker of power strength of electric wave. The power strength of electric wave with 3 antennas showed stronger than its with 2 antennas. With 2 antennas, the coefficient of correlation between the power strength of electric wave and response ability of tag was 0.665 (p=0.009), and it showed results at significance level. With 3 antennas, the coefficient of correlation was 0.711 (p=0.004), correlationship between the power strength of electric wave and the response ability of tag showed at significance high level. From the analysis result about tag reading performance on the gate type RFID system, the reading rate was good when tags were attached on a acrylic plate which were located in front of 3 or 4 antennas. As tags were getting away from antennas, the reading rate was decreased. The nearer from antennas, the higher the reading rate at the center. When tags were turned at right angles with antennas, the longer distant from antennas, the lower reading rates at the center, right and left locations. When the number of antennas and distance are constant, respectively, the significant difference of the tag reading rates according to the locations of left, right and center were not found.

The Optimized Detection Range of RFID-based Positioning System using k-Nearest Neighbor Algorithm

  • Kim, Jung-Hwan;Heo, Joon;Han, Soo-Hee;Kim, Sang-Min
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.10a
    • /
    • pp.270-271
    • /
    • 2008
  • The positioning technology for a moving object is an important and essential component of ubiquitous communication computing environment and applications, for which Radio Frequency IDentification Identification(RFID) is has been considered as also a core technology for ubiquitous wireless communication. RFID-based positioning system calculates the position of moving object based on k-nearest neighbor(k-nn) algorithm using detected k-tags which have known coordinates and k can be determined according to the detection range of RFID system. In this paper, RFID-based positioning system determines the position of moving object not using weight factor which depends on received signal strength but assuming that tags within the detection range always operate and have same weight value. Because the latter system is much more economical than the former one. The geometries of tags were determined with considerations in huge buildings like office buildings, shopping malls and warehouses, so they were determined as the line in 1-Dimensional space, the square in 2-Dimensional space and the cubic in 3-Dimensional space. In 1-Dimensional space, the optimal detection range is determined as 125% of the tag spacing distance through the analytical and numerical approach. Here, the analytical approach means a mathematical proof and the numerical approach means a simulation using matlab. But the analytical approach is very difficult in 2- and 3-Dimensional space, so through the numerical approach, the optimal detection range is determined as 134% of the tag spacing distance in 2-Dimensional space and 143% of the tag spacing distance in 3-Dimensional space. This result can be used as a fundamental study for designing RFID-based positioning system.

  • PDF

Simplified Tag Collection Algorithm for Improving Performance of Active RFID System (능동형 RFID 시스템의 성능 개선을 위한 간소화된 태그 수집 알고리즘)

  • Lim, Intaek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.731-736
    • /
    • 2017
  • In this paper, we propose a simplified tag collection algorithm to improve the performances of ISO/IEC 18000-7, which is a standard for an active RFID system. The proposed algorithm modifies the collection command that enables to start a tag collection round. The modified collection command includes the results of the listen period response for the previous collection round. Tags that receive the collection command check the collision status for their responses. If there is no collision, tags transmit their additional data and go into the sleep mode without the point-to-point read command and sleep command. A collection round for the standard consists of a collection command and response, a read command and response, and sleep command. On the other hand, in the proposed algorithm, a collection round consists of a collection command and response. The simulation results showed that the proposed algorithm can improve the identification delay about 16% compared with the standard when the number of tags are 300.

Study on the Performance Improvement of Active RFID System (능동형 RFID 시스템의 성능 향상을 위한 연구)

  • Kim, Ji-Tae;Kim, Jin-Sung;Lee, Kang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.5
    • /
    • pp.871-885
    • /
    • 2015
  • The improved DFSA for 2.4GHz multi-tags active RFID is suggested in 2 different ways: 1) simplified tag collection and Ack procedure using query command and 2) modified Schoute's method to control the number of slots in the frame. To evaluate the performance of the improved system we develop the simulation model. Varying the number of tags in the system we track the performance measures such as throughput, recognition time for multi-tags and tag recognition rate during a given time. The suggested method shows the best performance over all measures. Simplification of collection and Ack commands using query commands contributes to reducing tag recognition time. And the modified Schoute's method which controls the frame size using $k_1$ and $k_2$ contributes to throughput improvement and reduces target cognition time by reducing the number of collection rounds.

RFID Security Authentication Protocol for the Ubiquitous Environment (유비쿼터스 환경을 위한 RFID 보안 인증 프로토콜)

  • Bae, Woo-Sik;Choi, Shin-Hyeong;Han, Kun-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.69-75
    • /
    • 2007
  • On the wireless communication between RFID Tag and Reader, there are some existing problems with weaknesses of security such as spoofing, replay, traffic analysis, position tracking, etc., in the established hash lock related algorithm. This paper has presented the comparison and analysis of the established hash lock related algorithm for privacy and in order to make up for this, also suggested a new security authentication algorithm based on hash which has an authentication protocol and creates hash function by using random numbers received from the reader on real time and every session. The algorithm suggested here can offer a several of usefulness for RFID authentication system and it has an advantage to reduce the amount of calculations compared to established algorithm. It also uses the tags needed among a lot of tags around which are expected later and it is expected to reduce a responsibility of the server by ending unnecessary tags' operation with time based.

  • PDF

Improvement of an Identified Slot Sacn-Based Active RFID Tag Collection Algorithm (인식 슬롯 스캔 기반 능동형 RFID 태그 수집 알고리즘 개선)

  • Yoon, Won-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.3
    • /
    • pp.199-206
    • /
    • 2013
  • This paper proposes a modified tag collection algorithm that improves the drawback of the identified slot scan-based tag collection algorithm presented in a previous paper to improve the tag collection performance in active RFID systems. The previous identified slot scan-based tag collection algorithm is optimized in situations where all the tags store the fixed size of data, so it could not result in a good performance improvement with tags having the variable size of data. The improved tag collection algorithm proposed in this paper first collects the slot size information required for the data transmission from each tag via the identified slot scan phase, and then performs the tag collection phase using the information, which resolves the problem of the previous identified slot scan-based tag collection algorithm. The simulation results for performance evaluation showed that the proposed tag collection algorithm resulted in the almost same tag collection performance as the previous algorithm when all the tags have the same size of data and led a large improvement of the tag collection performance in ISO/IEC 18000-7 unlike the previous algorithm when each tag has a random size of data.

Development of Daily Life Monitori ng System using RFID (RFID를 이용한 일상생활 모니터링 시스템 개발)

  • Jung, Kyung-Kwon;Park, Hyun-Sik;Choi, Woo-Seung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.7
    • /
    • pp.49-56
    • /
    • 2009
  • In this paper, we present a daily activity monitoring system by using a wireless sensor network. The proposed system is installed in glove for activity monitoring. The RFID reader, to send data by using sensor network platform and RFID tag are small size, the shape of quadrangle, and operate in the frequency of 13.56 MHz. The sensor node can read RFID tags on the various objects used in daily living such as furniture, medicines, and kitchenwares. The sensor node reads the data of RFID tags, it transmits wireless packets to the sink node. The sink node sends the received packet immediately to a server system. The data from each RFID system is collected into a database, and then the data are processed to visualize the measurement of daily living activities of users. We provide a web-based monitoring system, and can see the number of RFID tag readings per day as bar charts. The result of experiments demonstrates that the way we propose can help to check the situation of life for people who live alone.

Unforgeable RFID Tag Variable ID Scheme with Efficient Identification (효율적인 식별 기능을 가진 위조 불가 RFID Tag 가변 ID 방식)

  • Choi, Jae-Gwi;Park, Ji-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.11C no.4
    • /
    • pp.447-454
    • /
    • 2004
  • This paper proposes unforgeable RFID variable n scheme with efficient identification. The existing schemes on privacy protection are in efficient because a server should execute identification process with all Tag ID's Information in order to identify a certain Tag. Moreover these schemes have the serious problem that an attacker can forge special tags if he can know tag's secret information stored in the server's database. Our scheme Is required only 2 times exponent computation to identify a tag. The proposed scheme is also secure against leakage of tags information stored in a database, because an attacker cannot forge special tag even if he knows secret information of the server(database).

Performance Analysis of Tag Identification Algorithm in RFID System (RFID 시스템에서의 태그 인식 알고리즘 성능분석)

  • Choi Ho-Seung;Kim Jae-Hyun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.5 s.335
    • /
    • pp.47-54
    • /
    • 2005
  • This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center). We also validated analytic results using OPNET simulation. Based on analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.