PROJECT TITLE :

Fast and Scalable Counterfeits Estimation for Large-Scale RFID Systems

ABSTRACT:

Many algorithms have been introduced to deterministically authenticate Radio Frequency Identification (RFID) tags, whereas little work has been done to handle scalability issue in batch authentications. Deterministic approaches verify tags one by one, and the communication overhead and time cost grow linearly with increasing size of tags. We have a tendency to style a quick and scalable counterfeits estimation theme, INformative Counting (INC), that achieves sublinear authentication time and communication price in batch verifications. The key novelty of INC builds on an FM-Sketch variant authentication synopsis that can capture key counting information using solely sublinear area. With the help of this well-designed knowledge structure, INC is ready to produce authentication results with accurate estimates of the number of counterfeiting tags and genuine tags, whereas previous batch authentication methods just offer zero/one results indicating the existence of counterfeits. We tend to conduct detailed theoretical analysis and extensive experiments to look at this design and therefore the results show that INC considerably outperforms previous work in terms of effectiveness and efficiency.