Merged search algorithms for radio frequency identification anticollision

Abstract

Nowadays, the Radio Frequency Identification (RFID) system enables the control of many devices over an open communication infrastructure ranging from a small home area network to the global Internet. Moreover, a variety of consumer products are tagged with remotely low-cost readable identification electromagnetic tags to replace Bar Codes. Applications such as automatic object tracking, inventory and supply chain management, and Web appliances were adopted for years in many companies. The arbitration algorithm for RFID system is used to arbitrate all the tags to avoid the collision problem with the existence of multiple tags in the interrogation field of a transponder. A splitting algorithm which is called Binary Search Tree (BST) is well known for multitags arbitration. In the current study, a splitting-based schema called Merged Search Tree is proposed to capture identification codes correctly for anticollision. Performance of the proposed algorithm is compared with the original BST according to time and power consumed during the arbitration process. The results show that the proposed model can reduce searching time and power consumed to achieve a better performance arbitration. Copyright © 2012 Bih-Yaw Shih et al.