Using Dynamic Slots Collision Tracking Tree Technique Towards An Efficient Tag Anti-collision Algorithm in RFID System

• Main Authors: Hsin-Mo Lin, 林欣模
• Other Authors: Chiu-Kuo Liang
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/96124644690127745989

碩士 === 中華大學 === 資訊工程學系碩士在職專班 === 100 === RFID is a generic term for technologies which use RF waves to identify, track, or categorize any object. One of the research areas in RFID systems is a tag anti-collision protocol; how to reduce identification time with a given number of tags in the field of an RFID reader. There are two types of tag anti-collision protocols for RFID systems: tree based algorithms and slotted aloha based algorithms. Many anti-collision algorithms have been proposed in recent years, especially in tree based protocols. However, there still have challenges on enhancing the system throughput and stability due to the underlying technologies had faced different limitation in system performance when network density is high. Recently, a Bi-slotted Collision Tracking Tree Algorithm (BSCTTA), which is a tree based approach, was proposed and aiming to speedup tag identification in large scale RFID systems. The main idea of BSCTTA is to track a collision bit and response two slots depending on the collision bit. In general, tree based algorithms send two extend prefixes which attached ‘0’ and ‘1’ when collision occurs. Base on the characteristic, both prefix overhead and iteration overhead can be reduced by BSCTTA scheme using time-divided response depending on whether the collided bit is ‘0’ or ‘1’. In this paper, we proposed a dynamic slots collision tracking tree algorithm, called the DSCTTA scheme, to improve the performance of BSCTTA. Our proposed DSCTTA method can reduce iteration overhead efficiently by time-divided response depending on tracking consecutive collision bits, and therefore can reduce prefix overhead further. The simulation results show that our proposed technique provides better performance than BSCTTA. It is shown that the DSCTTA is effective in terms of increasing system throughput and minimizing identification delay.