An Efficient Early-breaking-estimation and Tree-splitting Missing RFID Tag Identification Protocol

Abstract

Retailers grapple with inventory losses primarily due to missing items, prompting the need for efficient missing tag identification methods in large-scale RFID systems. Among them, few works considered the effect of unexpected unknown tags on the missing tag identification process. With the presence of unknown tags, some missing tags may be falsely identified as present. Thus, the system’s reliability is hardly guaranteed. To resolve these challenges, we propose an efficient early-breaking-estimation and tree-splitting-based missing tag identification (ETMTI) protocol for large-scale RFID systems. ETMTI employs innovative early-breaking-estimation and deactivation methods to swiftly handle unknown tags. Subsequently, a tree-splitting-based missing tag identification method is proposed, employing a B-ary splitting tree, to rapidly identify missing tags. Additionally, a bit-tracking response strategy is implemented to reduce processing time. Theoretical analysis is conducted to determine optimal parameters for ETMTI. Simulation results illustrate that our proposed ETMTI protocol significantly outperforms benchmark methods, offering a shorter processing time and a lower false negative rate.