A Lower Bound on the Average Identification Time in a Passive RFID System
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review
Details
| Original language | English |
|---|---|
| Title of host publication | Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings |
| Publisher | Springer Verlag |
| Pages | 524-534 |
| Number of pages | 11 |
| ISBN (Print) | 9783030011673 |
| DOIs | |
| Publication status | Published - 2018 |
| Publication type | A4 Article in a conference publication |
| Event | International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networks and Systems Conference on Internet of Things and Smart Spaces - Duration: 27 Aug 2018 → 29 Aug 2018 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 11118 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networks and Systems Conference on Internet of Things and Smart Spaces |
|---|---|
| Period | 27/08/18 → 29/08/18 |
Abstract
One of the most well-known standards for radio frequency identification (RFID), the standard ISO 18000-6C, collects the requirements for RFID readers and tags and regulates respective communication protocols. In particular, the standard introduces the so-called Q-algorithm resolving conflicts in the channel (which occur when several RFID tags respond simultaneously). As of today, a vast amount of existing literature addresses various modifications of the Q-algorithm; however, none of them is known to significantly reduce the average identification time (i.e., the time to identify all proximate tags). In this work, we derive a lower bound for the average identification time in an RFID system. Furthermore, we demonstrate that in case of an error-free channel, the performance of the legacy Q-algorithm is reasonably close to the proposed lower bound; however, for the error-prone environment, this gap may substantially increase, thereby indicating the need for new identification algorithms.