• Title/Summary/Keyword: framed query tree

Search Result 3, Processing Time 0.015 seconds

A DFS-ALOHA Algorithm with Slot Congestion Rates in a RFID System (RFID시스템에서 슬롯의 혼잡도를 이용한 DFS-ALOHA 알고리즘)

  • Lee, Jae-Ku;Choi, Seung-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.267-274
    • /
    • 2009
  • For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.

Improvement and Performance Analysis of Hybrid Anti-Collision Algorithm for Object Identification of Multi-Tags in RFID Systems (RFID 시스템에서 다중 태그 인식을 위한 하이브리드 충돌방지 알고리즘의 개선 및 성능 분석)

  • Choi, Tae-Jeong;Seo, Jae-Joon;Baek, Jang-Hyun
    • IE interfaces
    • /
    • v.22 no.3
    • /
    • pp.278-286
    • /
    • 2009
  • The anti-collision algorithms to identify a number of tags in real-time in RFID systems are divided into the anti-collision algorithms based on the Framed slotted ALOHA that randomly select multiple slots to identify the tags, and the anti-collision algorithms based on the Tree-based algorithm that repeat the questions and answer process to identify the tags. In the hybrid algorithm which is combined the advantages of these algorithms, tags are distributed over the frames by selecting one frame among them and then identified by using the Query tree frame by frame. In this hybrid algorithm, however, the time of identifying all tags may increase if many tags are concentrated in a few frames. In this study, to improve the performance of the hybrid algorithm, we suggest an improved algorithm that the tags select a specific group of frames based on the earlier bits of the tag ID so that the tags are distribute equally over the frames. By using the simulation and mathematical analysis, we show that the suggested algorithm outperforms traditional hybrid algorithm from the viewpoint of the number of queries per frame and the time of identifying all tags.

An Efficient Hybrid Anti-collision Method in RFID systems (RFID 시스템에서 Hybrid 방식을 이용한 효율적인 충돌 회피 기법)

  • Shin, Song-Yong;Hwang, Gyung-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.8
    • /
    • pp.1619-1624
    • /
    • 2012
  • If multiple Tags in the RFID System transmit their IDs to the Reader at the same time, tag identification time is delayed due to collisions. Therefore, to reduce the reader's identification time, an efficient anti-collision technology is needed. In this paper, we propose a hybrid anti-collision method based on the QT and DFSA. Then, the performances of proposed method are compared with the existing method through extensive simulations.