• Title/Summary/Keyword: Anticollision

Search Result 13, Processing Time 0.018 seconds

Conception and Performance Analysis of Efficient CDMA-Based Full-Duplex Anti-collision Scheme

  • Cao, Xiaohua;Li, Tiffany
    • ETRI Journal
    • /
    • v.37 no.5
    • /
    • pp.929-939
    • /
    • 2015
  • Ultra-high-frequency radio-frequency identification (UHF RFID) is widely applied in different industries. The Frame Slotted ALOHA in EPC C1G2 suffers severe collisions that limit the efficiency of tag recognition. An efficient full-duplex anti-collision scheme is proposed to reduce the rate of collision by coordinating the transmitting process of CDMA UWB uplink and UHF downlink. The relevant mathematical models are built to analyze the performance of the proposed scheme. Through simulation, some important findings are gained. The maximum number of identified tags in one slot is g/e (g is the number of PN codes and e is Euler's constant) when the number of tags is equal to mg (m is the number of slots). Unlike the Frame Slotted ALOHA, even if the frame size is small and the number of tags is large, there aren't too many collisions if the number of PN codes is large enough. Our approach with 7-bit Gold codes, 15-bit Gold codes, or 31-bit Gold codes operates 1.4 times, 1.7 times, or 3 times faster than the CDMA Slotted ALOHA, respectively, and 14.5 times, 16.2 times, or 18.5 times faster than the EPC C1 G2 system, respectively. More than 2,000 tags can be processed within 300 ms in our approach.

Performance Improvement of Anti-collision Algorithm for RFID Protocol and Algorithm Comparison (RFID 프로토콜의 충돌방지 알고리즘의 성능 개선과 알고리즘 비교)

  • Lim, Jung-Hyun;Kim, Ji-Yoon;Jwa, Jeong-Woo;Yang, Doo-Yeong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.6
    • /
    • pp.51-61
    • /
    • 2007
  • In this paper, Air-interface protocols of ISO 18000-6 Types and EPCglobal Classes applied to RFID system in UHF band are analyzed, and those anticollision algorithms are realized. Also, the each algorithm which improves the performance of standard protocol is proposed, and the performance is compared when clock period of link timing is a identical condition on $12.5{\mu}s$. As the result, when 500 tags exist simultaneously inside reader interrogation zone, the tag recognition performance of a standard protocol is better in preceding order of Class-1 Generation-1, Type B, Type A, Class-0 and Class-1 Generation-2. And also the performance of improved protocol is better in ascending order of Type B, Type A, Class-1 Generation-1, Class-0 and Class-1 Generation-2. Therefore, performance of tag recognition remarkably depends on the regulated clock period in the protocol and link timing between a reader and a tag.

An Efficient Tag Sleep Method for Improving Tag Collection Performance in Active RFID Systems (능동형 RFID 시스템에서 태그 수집 성능 향상을 위한 효율적인 태그 슬립 기법)

  • Yoon, Won-Ju;Chung, Sang-Hwa;Park, Shin-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.686-693
    • /
    • 2009
  • In this paper, we propose an efficient tag sleep method utilizing empty time slots for improving the tag collection performance in active RFID systems. In the proposed tag sleep method, the reader detects the occurrence of empty time slots by carrier sensing and utilizes the wasted empty time slots to transmit sleep commands to the collected tags throughout the framed slotted aloha-based tag collection process, resulting in reducing the time required for tag collection. Via the simulation experiments, we evaluated the performance of the tag collection applied with the proposed tag sleep method, compared with that of the basic tag collection. The simulation results showed that the tag collection applied with the proposed tag sleep method could reduce the average tag collection time by 12.28%, 12.30%, and 13.31 %, for the framed slotted aloha with the fixed 128 time slots and 256 time slots, and the dynamic framed slotted aloha anticollision protocols, respectively.