Abstract

Nowadays, Radio Frequency Identification (RFID) systems are widely used in commercial applications such as warehouse management, artificial intelligence, intelligent robot and automation control to identify the tagged goods or materials. When there is the existence of multiple tags in the interrogation field of a transponder, the arbitration algorithm for RFID system is used to arbitrate all the tags to avoid the collision problem. A splitting algorithm which is called Binary Search Tree (BST) is well-known for multi-tags arbitration. In this paper, a quadtree search algorithm is developed to avoid collision. Then, its performance is compared with binary search tree and binary search tree with cut-through according to cost, mean number of stages for successfully arbitrating an RFID device, during the arbitration process. Comparing with the traditional DFSA algorithm, the simulation results show that our model reaches better performance with respect to reducing the cost and tag reading time.

Key words: Radio Frequency Identification (RFID), arbitration problem, anti-collision, binary search tree, quadtree.