Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 609035, 20 pages
Research Article

Merged Search Algorithms for Radio Frequency Identification Anticollision

1Department and Graduate School of Computer Science, National Pingtung University of Education, No. 4-18, Ming Shen Road, Pingtung 90003, Taiwan
2Institute of Maritime Information and Technology, National Kaohsiung Marine University, Kaohsiung City 80543, Taiwan
3Global Earth Observation and Data Analysis Center (GEODAC), National Cheng Kung University, No 1, Ta-Hsueh Road, Tainan 701, Taiwan

Received 16 July 2011; Accepted 11 December 2011

Academic Editor: Andrzej Swierniak

Copyright © 2012 Bih-Yaw Shih et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.