Nowadays, the Radio Frequency Identification RFID system enables the control of many devices\r\nover an open communication infrastructure ranging from a small home area network to the global\r\nInternet. Moreover, a variety of consumer products are tagged with remotely low-cost readable\r\nidentification electromagnetic tags to replace Bar Codes. Applications such as automatic object\r\ntracking, inventory and supply chain management, and Web appliances were adopted for years\r\nin many companies. The arbitration algorithm for RFID system is used to arbitrate all the tags\r\nto avoid the collision problem with the existence of multiple tags in the interrogation field of a\r\ntransponder. A splitting algorithm which is called Binary Search Tree BST is well known for\r\nmultitags arbitration. In the current study, a splitting-based schema called Merged Search Tree is\r\nproposed to capture identification codes correctly for anticollision. Performance of the proposed\r\nalgorithm is compared with the original BST according to time and power consumed during the\r\narbitration process. The results show that the proposed model can reduce searching time and\r\npower consumed to achieve a better performance arbitration.
Loading....