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 off-the-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.
Read full abstract