1-3hit |
Younghwan JUNG Daehee KIM Sunshin AN
In this paper, we analyze two representative tree-based RFID anti-collision algorithms: the Query Tree protocol and the Binary Search algorithm. Based on the advantages and disadvantages of the two algorithms, we propose and evaluate two optimized anti-collision algorithms: the Optimized Binary Search, which performs better than the Query Tree Protocol with the same tag-side overhead, and the Optimized Binary Search with Multiple Collision Bits Resolution algorithm, which performs the best with an acceptable increase in tag-side processing overhead.
Channel errors may exist in Radio Frequency IDentification (RFID) systems due to low power backscattering of tags. These errors prevent the rapid identification of tags, and reducing this deterioration is an important issue. This paper presents performance analysis of various tag anti-collision algorithms and shows that the performances of RFID systems can be improved by applying a proposed robust algorithm in error-prone environments.
Dae-Ken KWON Wan-Jin KIM Hyoung-Nam KIM
This paper proposes a novel method to suppress tag collision in the ISO 18000-6 type B protocol which is one of the standard protocols of UHF RFID systems. The anti-collision performance in terms of the total identification time is improved by reducing the length of bits and the number of transmission commands required for multi-tag identification in the ISO 18000-6 type B protocol. Simulation results show that the proposed method improves the multi-tag identification time by about 15% over the conventional method, irrespective of the number of tags.