Young Back Kim, Sung Soo Kim, Kyung Ho Chung, Kwang Seon Ahn, Journal of Internet Computing and Services, Vol. 14, No. 4, pp. 25-34, Aug. 2013
10.7472/jksii.2013.14.4.25, Full Text:  HTML
Keywords: Anti-collision, Collision Tracking, Slotted Query Tree, 4-Bit Pattern

Abstract

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the 4-Bit Pattern Slot Allocation(4-BPSA) algorithm for the high-speed identification of the multiple tags. The proposed algorithm is based on the tree algorithm using the time slot and identify the tag quickly and efficiently through accurate prediction using the a slot as a 4-bit pattern according to the slot allocation scheme. Through mathematical performance analysis, We proved that the 4-BPSA is an O(n) algorithm by analyzing the worst-case time complexity and the performance of the 4-BPSA is improved compared to existing algorithms. In addition, we verified that the 4-BPSA is performed the average 0.7 times the query per the Tag through MATLAB simulation experiments with performance evaluation of the algorithm and the 4-BPSA ensure stable performance regardless of the number of the tags.

Statistics
Cite this article