Date Added: Aug 2011
Fast searching a particular subset in a large number of products attached with RFID tags is of practical importance for a variety of applications but not yet thoroughly investigated. Since the cardinality of the products can be extremely large, collecting the tag information directly from each of those tags could be highly inefficient. To address the tag searching efficiency in large-scale RFID systems, this paper proposes several algorithms to meet the stringent delay requirement in developing fast tag searching protocols. The authors formally formulate the tag searching problem in large-scale RFID systems. They propose utilizing compact approximators to efficiently aggregate a large volume of RFID tag information and exchange such information with a two-phase approximation protocol.