An Improved Highly Efficient Tag Identification Algorithm in Dynamic RFID Systems

• Main Authors: CHANG, CHENG-HUANG, 張正璜
• Other Authors: LIANG, CHIU-KUO
• Format: Others
• Language: zh-TW
• Published: 2019
• Online Access: http://ndltd.ncl.edu.tw/handle/md6x8w

碩士 === 中華大學 === 資訊工程學系 === 107 === Radio frequency identification (RFID) is a system, consisting of Reader, Tag and Chip, that identifies the data transferring into radio waves atomically by using radio frequency technology, which belongs to an uncontacted-recognition type. Since the system has a lot of advantages such as fast identification, small in size, cheaper and so on, it is commonly used in many situations like access control system and warehouse management. However, there is an important problem in the use of multiple-tag identification called Tag Collision should be solved. Although there are many algorithms trying to work the collision, it could not record and analyse previous results been tagged in these traditional identifications. It causes identifiable inefficiency with the next tag because of too many collisions and idle nodes. This thesis talks about an algorithm named dynamic identification that mainly utilizes on the warehouse management in which the IDs are moving in and out constantly. It could be able to resolve the UID's collision and to reduce the idle nodes as well as improving the speed of tag identification. The algorithm discussed in this paper aims to the unbalanced distribution that receivers get a series signal of movement to improve the random tags. It integrates with EBQT (Enhance Bit Collision Detection Query Tree) algorithm and introduces another algorithm called LBQT (Leaf Node Bit Collision Detection Query Tree) in the stage of dynamic identification. This method could efficiently get LBQT becoming better in the unbalanced distribution just by modifying the algorithm of Reader without any hardware costs.