Time-Efficient Range Detection in Commodity RFID Systems

Abstract

RFID is becoming ubiquitously available in our daily life. After RFID tags are deployed to make attached objects identifiable, a natural next step is to communicate with the tags and collect their information for the purpose of tracking tagged objects or monitoring their surroundings in real-time. In this paper, we study an under-investigated problem range detection in a commodity RFID system, which aims to check if there are any tags with the data between an upper and lower boundary in a time-efficient way. This is important especially in a large RFID system, which can help users quickly pinpoint the target tags (if any) and give an early warning to users for taking urgent actions and reducing the potential risk in the nascent stage. We propose two tailored protocols, selective query and range query, to achieve range detection within the scope of the C1G2 standard. The novelty is that, instead of querying each tag, we exploit the capability of C1G2-compatible selection and quickly separate target tags from others by silencing most of tags. The final result is that range query is able to achieve a range detection with only one query command. We implement the proposed protocols in commodity RFID systems, with no need for any hardware modifications. Extensive experiments show that range query is able to improve the time efficiency by an order of magnitude, compared with the baseline.