Fast and Effective Tag Searching for Multi-Group RFID Systems

Abstract

In RFID-assisted applications, the customers often request to provide the tag searching service to determine which specific tags are present in the system. In practice, tags are usually divided into different groups to represent different categories or brands. We found that the traditional tag searching protocols are not very appropriate for multi-group RFID scenarios because they cannot ensure that the searching results of each group satisfy the predefined reliability requirements. Therefore, we develop a series of effective multi-group tag searching schemes. B-Search is a basic method that leverages the filter vector and the indicator vector to perform tag searching for each group sequentially. G-Search and A-Search are two parallel multi-group tag searching schemes. G-Search selects the longest frame length as the frame length of all groups, while A-Search can adaptively adjust the frame length of each group to improve the searching efficiency. We evaluate the performance of the proposed protocols through theoretical analysis and discuss the optimal parameter settings to minimize the execution time. Extensive simulations illustrate that both G-Search and A-Search can achieve fast and effective multi-group tag searching.