Receive Only Necessary: Efficient Tag Category Identification in Large-Scale RFID Systems

RFID systems have been widely deployed for various applications such as inventory control, retail management, and object tracking. In many scenarios, coarse-grained system management of tag categories is more common than traditional system management of individual tags. Existing works on tag category management require knowing category IDs in advance, however, few protocols have been specially designed to obtain category IDs in multi-category RFID systems. In this paper, we propose
CIP
, a time-efficient protocol specially designed to collect category IDs in multi-category RFID systems. The challenge in solving this problem is to avoid repeatedly collecting category IDs from multiple tags belonging to the same category. We address this challenge by squeezing tags in the same category into the same time slot and letting them reply to the reader simultaneously. Considering that the reader may receive signals from different tags in a slot, we exploit the Manchester coding to decode the aggregated signals. With this design, CIP collects each category ID only once and thus achieves high time efficiency by avoiding redundant identification of the same category ID. We further enhance CIP by utilizing the lightweight vectors to specify the order of tags’ replying and avoid useless slots. Rigorous theoretical analysis is presented to optimize the performance of CIP and guidelines on how to set optimal parameters to minimize the overall execution time are given. We conduct extensive experiments to evaluate the performance of our protocols. The experimental results show that our protocols can significantly improve time efficiency by 67 percent when compared with the state-of-the-art solutions.