A Lower Bound on the Average Identification Time in a Passive RFID System

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. © Springer Nature Switzerland AG 2018.

Authors
Stepanov N.1 , Matveev N. 1 , Galinina O. 2, 3 , Turlikov A. 1
Language
English
Pages
524-534
Status
Published
Volume
11118 LNCS
Year
2018
Organizations
  • 1 State University of Aerospace Instrumentation, Saint-Petersburg, Russian Federation
  • 2 Tampere University of Technology, Tampere, Finland
  • 3 Peoples Friendship University of Russia (RUDN University), Moscow, Russian Federation
Keywords
Internet of things; Next generation networks; Error-free channels; Error-prone environments; Identification algorithms; ISO 18000-6C; Lower bounds; Q algorithms; RFID readers; RFID systems; Radio frequency identification (RFID)
Date of creation
04.02.2019
Date of change
04.02.2019
Short link
https://repository.rudn.ru/en/records/article/record/36490/
Share

Other records