Tag-selection problem, which selects a set of wanted tags from a tag population, is vital for boosting efficiencies of the real-time applications in RFID systems. However, prior arts for the problem can not be applied to RFID systems directly, given that they either require additional computing functions implemented in tag's chips or require a time-consuming pre-process with a large communication cost. This paper studies the tag-selection problem and propose an efficient Electronic Product Code (EPC)-based tag selection method with theoretical analysis. In particular, firstly, we prove a nontrivial lower bound of communication overhead for a protocol which is capable of solving the tag-selection problem. Secondly, we propose an efficient protocol, denoted by TagSP, which only uses the ''select'' command (a mandatory command that all RFID tags shall support) and EPC. The proposed TagSP can be applied directly into offthe-shelf RFID systems with a communication overhead close to the lower bound. Extensive simulations are conducted and the simulation results show TagSP's superiority compared with existing protocols. INDEX TERMS RFID systems, tag selection, lower bound of communication overhead, EPC.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.