关键词:
RFID
Missing key tag identification
Time efficiency
Robust
摘要:
Radio Frequency Identification(RFID)technology has been widely used to identify missing *** many applications,rapidly pinpointing key tags that are attached to favorable or valuable items is *** realize this goal,interference from ordinary tags should be avoided,while key tags should be efficiently *** many previous studies,how to rapidly and dynamically filter out ordinary tags when the ratio of ordinary tags changes has not been ***,how to efficiently verify missing key tags in groups rather than one by one has not been explored,especially with varying missing *** this paper,we propose an Efficient and Robust missing Key tag Identification(ERKI)protocol that consists of a filtering mechanism and a verification ***,the filtering mechanism adopts the Bloom filter to quickly filter out ordinary tags and uses the labeling vector to optimize the Bloom filter's performance when the key tag ratio is ***,the verification mechanism can dynamically verify key tags according to the missing rates,in which an appropriate number of key tags is mapped to a slot and verified at ***,we theoretically analyze the parameters of the ERKI protocol to minimize its execution *** numerical results show that ERKI can accelerate the execution time by more than 2.14compared with state-of-the-art solutions.