Radio Frequency Identification(RFID)technology has been widely used to identify missing items.In many applications,rapidly pinpointing key tags that are attached to favorable or valuable items is critical.To realize t...Radio Frequency Identification(RFID)technology has been widely used to identify missing items.In many applications,rapidly pinpointing key tags that are attached to favorable or valuable items is critical.To realize this goal,interference from ordinary tags should be avoided,while key tags should be efficiently verified.Despite many previous studies,how to rapidly and dynamically filter out ordinary tags when the ratio of ordinary tags changes has not been addressed.Moreover,how to efficiently verify missing key tags in groups rather than one by one has not been explored,especially with varying missing rates.In this paper,we propose an Efficient and Robust missing Key tag Identification(ERKI)protocol that consists of a filtering mechanism and a verification mechanism.Specifically,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 high.Furthermore,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 once.Moreover,we theoretically analyze the parameters of the ERKI protocol to minimize its execution time.Extensive numerical results show that ERKI can accelerate the execution time by more than 2.14compared with state-of-the-art solutions.展开更多
基金This work was supported in part by the National Natural Science Foundation of China under project contracts No.61971113 and 61901095in part by National Key R&D Program under project contract No.2018AAA0103203+5 种基金in part by Guangdong Provincial Research and Development Plan in Key Areas under project contract No.2019B010141001 and 2019B010142001in part by Sichuan Provincial Science and Technology Planning Program under project contracts No.2020YFG0039,No.2021YFG0013 and No.2021YFH0133in part by Ministry of Education China Mobile Fund Program under project contract No.MCM20180104in part by Yibin Science and Technology Program-Key Projects under project contract No.2018ZSF001 and 2019GY001in part by Central University Business Fee Program under project contract No.A03019023801224the Central Universities under Grant ZYGX2019Z022.
文摘Radio Frequency Identification(RFID)technology has been widely used to identify missing items.In many applications,rapidly pinpointing key tags that are attached to favorable or valuable items is critical.To realize this goal,interference from ordinary tags should be avoided,while key tags should be efficiently verified.Despite many previous studies,how to rapidly and dynamically filter out ordinary tags when the ratio of ordinary tags changes has not been addressed.Moreover,how to efficiently verify missing key tags in groups rather than one by one has not been explored,especially with varying missing rates.In this paper,we propose an Efficient and Robust missing Key tag Identification(ERKI)protocol that consists of a filtering mechanism and a verification mechanism.Specifically,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 high.Furthermore,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 once.Moreover,we theoretically analyze the parameters of the ERKI protocol to minimize its execution time.Extensive numerical results show that ERKI can accelerate the execution time by more than 2.14compared with state-of-the-art solutions.
