Efficient Access Algorithms for Dynamic Many-Tag Passive RFID Storage Systems
In this paper, the authors investigate efficient algorithms for accessing information stored in a large number of RFID tags. Interrogators, equipped with RFID scanners, regularly arrive at the tag system, read from and write messages to the tags, and then leave. They develop techniques for the interrogators to read the newest messages from the tags as quickly as possible, since newer information is often the most relevant and interesting. The authors borrow ideas from aloha and query tree, two traditional singulation schemes, to form the authors' many-tag access algorithms. The authors query tree-based algorithms access tags faster, but are not as robust as their aloha-based algorithms.