Abstract
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.
Highlights
Radio frequency identification (RFID) is widely used in many applications, such as warehouse controlling [1]–[8], library inventory [9]–[11] and object tracking [8], [12]–[18]
This paper focuses on the tag-selection problem in RFID system, where the task is to pick a subset P of tags from a tag population S by using as little communication time as possible
CHALLENGES AND TECHNICAL CONTRIBUTIONS This paper is targeted for designing an efficient protocol for the tag-selection that can both applied to every off-the-shelf RFID system directly, and has a communication cost close to the nontrivial lower bound
Summary
Radio frequency identification (RFID) is widely used in many applications, such as warehouse controlling [1]–[8], library inventory [9]–[11] and object tracking [8], [12]–[18]. CHALLENGES AND TECHNICAL CONTRIBUTIONS This paper is targeted for designing an efficient protocol for the tag-selection that can both applied to every off-the-shelf RFID system directly, and has a communication cost close to the nontrivial lower bound Towards this goal, we need to answer two challenging problems. This protocol first analyzes the tags’ EPCs carefully to build a set of filter substrings, and smartly chooses some substrings from this built set of filter substrings, such that the tag-selection problem can be solved by issuing a few ‘‘select’’ commands (see Algorithm 1) To this end, we study the efficient tag-selection problem in RFID systems with universal applicability and a small communication time.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
