• Title/Summary/Keyword: EPCglobal Gen 2

Search Result 33, Processing Time 0.035 seconds

A Scheme to Optimize Q-Algorithm for Fast Tag Identification (고속 태그 식별을 위한 Q-알고리즘 최적화 방안)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2541-2546
    • /
    • 2009
  • In the anti-collision scheme proposed by EPCglobal Class-1 Gen-2 standard, the frame size for a query round is determined by Q-algorithm. In the Q-algorithm, the reader calculates a frame size without estimating the number of tags in it's identification range. It uses only the slot status. Therefore, the Q-algorithm has advantage that the reader's algorithm is simpler than other DFSA algorithms. However, the standard does not define an optimized parameter value for adjusting the frame size. In this paper, we propose the optimized parameter values for minimizing the identification time by various computer simulations.

EPCglobal Class-1 Gen-2 Q-Algorithm with Tag Number Estimation (태그 수 추정을 이용한 EPCglobal Class-1 Gen-2 Q-알고리즘)

  • Lim, Intaek
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.723-725
    • /
    • 2016
  • In Gen-2 Q-algorithm, if the number of tags is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round through the tag number estimation and.

  • PDF

Technique for Enhancing Security and Analyses of Vulnerability of RFID Tag security and Protocol (RFID 태그 보안과 프로토콜의 취약점 분석 및 보안성 향상을 위한 기법)

  • Kim, Jung-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.6
    • /
    • pp.1307-1312
    • /
    • 2011
  • Radio Frequency Identification(RFID) has been considered as an key infrastructure for the ubiquitous society. However, due to the inherent drawbacks, RFID causes var- ious security threats like privacy problems, tag cloning, etc. This paper proposes a novel practical approach, which are fully conformed to EPCglobal RFID Gen2 standard, for enhancing security of currently used RFID Gen2 tags against the various security threats.

Tag Anti-Collision Algorithms in Passive and Semi-passive RFID Systems -Part I : Adjustable Framed Q Algorithm and Grouping Method by using QueryAdjust Command- (수동형/반능동형 RFID 시스템의 태그 충돌 방지 알고리즘 -Part I : QueryAdjust 명령어를 이용한 AFQ 알고리즘과 Grouping에 의한 성능개선-)

  • Song, In-Chan;Fan, Xiao;Chang, Kyung-Hi;Shin, Dong-Beom;Lee, Heyung-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8A
    • /
    • pp.794-804
    • /
    • 2008
  • In this paper, we analyze the performance of probabilistic slotted anti-collision algorithm used in EPCglobal Class-1 Generation-2 (Gen2). To increase throughput and system efficiency, and to decrease tag identification time and collision ratio, we propose new tag anti-collision algorithms, which are FAFQ (fired adjustable flamed Q) algorithm and AAFQ (adaptive adjustable framed Q) algorithm, by using QueryAdjust command. We also propose grouping method based on Gen2 to improve the efficiency of tag identification. The simulation results show that all the proposed algorithms outperform Q algorithm, and AAFQ algorithm performs the best. That is, AAFQ has an increment of 5% of system efficiency and a decrement of 4.5% of collision ratio. For FAFQ and AAFQ algorithm, the performance of grouping method is similar to that of ungrouping method. However, for Q algorithm in Gen2, grouping method can increase throughput and system efficiency, and decrease tag identification time and collision ratio compared with ungrouping method.

Implementation & Verification of RFID Gen2 Protocol on FPGA Prototyping board (FPGA를 이용한 RFID Gen2 protocol의 구현 및 검증)

  • Je, Young-Dai;Kim, Jae-Lim;Jang, Il-Su;Yang, Hoon-Gee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.869-872
    • /
    • 2008
  • This paper presents the VHDL implementation procedure of the passive RFID tag in Ultra High Frequency RFID system. The operation of the tag compatible with the EPCglobal Class1 Generation2(GEN2) protocol is verified by timing simulation after synthesis and implementation on prototyping board. Due to the reading range with relatively large distance, a passive tag needs digital processor which facilitates faster decoding, encoding and state transition for enhancement of the interrogation rate. Also with UART communication, verify a inventory Round in Gen2 Protocol. The verification results with the fastest data rate, 640kbps, and multi tags environment scenario show that the implemented tag spend 1.4ms transmitting the 96bits EPC to reader.

  • PDF

VHDL Implementation of GEN2 Protocol for UHF RFID Tag (RFID GEN2 태그 표준의 VHDL 설계)

  • Jang, Il-Su;Yang, Hoon-Gee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1311-1319
    • /
    • 2007
  • This paper presents the VHDL implementation procedure of the passive RFID tag operating in Ultra High Frequency. The operation of the tag compatible with the EPCglobal Class1 Generation2(GEN2) protocol is verified by timing simulation after synthesis and implementation. Due to the reading range with relatively large distance, a passive tag needs digital processor which facilitates faster decoding, encoding and state transition for enhancement of an interrogation rate. In order to satisfy linking time, the pipe-line structure is used, which can minimize latency to serial input data stream. We also propose the sampling strategy to decode the Preamble, the Frame-sync and PIE symbols in reader commands. The simulation results with the fastest data rate and multi tags environment scenario show that the VHDL implemented tag performs faster operation than GEN2 proposed.

Weight Decision Scheme based on Slot-Count in Gen-2 Q-Algorithm

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.172-176
    • /
    • 2011
  • In the Gen-2 Q-algorithm, the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not optimized in the standard. However, the standard suggests that the reader uses small values of C when the slot-count is large and larger values of C when the slot-count is small. In this case, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to select the weight based on the slot-count size of current query round. Through various computer simulations, it is demonstrated that the proposed scheme achieves more stable performances than Gen-2 Q-algorithm.

Initial Slot-Count Selection Scheme with Tag Number Estimation in Gen-2 RFID System

  • Lim, In-Taek;Ryu, Young-Tae
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.5
    • /
    • pp.519-523
    • /
    • 2010
  • In Gen-2 RFID system, the initial value of $Q_{fp}$, which is the slot-count parameter of Q-algorithm, is not defined in the standard. In this case, if the number of tags within the reader's identification range is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to allocate the optimal initial $Q_{fp}$ through the tag number estimation before the query round begins. Through computer simulations, it is demonstrated that the proposed scheme achieves more stable performance than Gen-2 Q-algorithm.

Performance Analysis of EPCglobl Gen-2 Q-Algorithm According to Weight and Initial Slot-Count

  • Lim, Intaek;Choi, Jin-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.635-637
    • /
    • 2012
  • In Gen-2 Q-algorithm, the value of initial $Q_{fp}$ and weight C is not defined in the standard. If we let the initial $Q_{fp}$ be large or small, the number of empty slot will be large during the initial query round or almost all the slots will be collided, respectively. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, it is anticipated that the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we analyze how the performances of Gen-2 Q-algorithm will be affected by the weight and initial slot-count size.

  • PDF