Are RFID Sensing Systems Ready for the Real World?
Bibliographic record
Abstract
Passive Radio Frequency IDentification (RFID) tags are commonly used to provide Radio Frequency (RF) accessible unique identifiers for physical objects due to their low-cost, lack of battery, and small size. Besides this basic function, many novel RFID-based sensing applications have been proposed in the last decade, including localization, gesture sensing, and touch sensing, among others. Nevertheless, none of these systems are in widespread use today. We hypothesize that this is because the accuracy of these systems does not meet application requirements when there are even minor changes in the RF environment or in tag geometry, i.e., changes in a tag's orientation or flexing. This paper uses both theoretical analysis and real-world experiments to test this hypothesis. Our theoretical analysis shows that even a small phase or RSS noise level can result in significant estimation errors. Our extensive real-world experiments find that both the absolute and differential values of phase and RSS readings of an RFID tag's signal can vary as much as by π radians and 10 dB, respectively, due to small changes in the tag's orientation or flexing. Because of these large variations, RFID-based application systems relying on the signal phase or RSS cannot meet application requirements, confirming our hypothesis. In addition to this strong negative result, we also present some insights into designing robust RFID systems that are suitable for use in the real world.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.023 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.007 |
| Scholarly communication | 0.007 | 0.023 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.005 | 0.004 |
| Insufficient payload (model declined to judge) | 0.008 | 0.006 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".