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

Nikita Stepanov; Nikolay Matveev; Olga Galinina; Andrey Turlikov

doi:10.1007/978-3-030-01168-0_47

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

Nikita Stepanov, Nikolay Matveev, Olga Galinina, Andrey Turlikov

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

13 Downloads (Pure)

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.

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	https://doi.org/10.1007/978-3-030-01168-0_47
Publication status	Published - 2018
Publication type	A4 Article in conference proceedings
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

Publication forum classification

Publication forum level 1

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-030-01168-0_47

stepanov2018Lower
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Accepted author manuscript, 350 KB

http://urn.fi/URN:NBN:fi:tuni-202001301656

Cite this

Stepanov, N., Matveev, N., Galinina, O., & Turlikov, A. (2018). A Lower Bound on the Average Identification Time in a Passive RFID System. In Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings (pp. 524-534). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11118 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-01168-0_47

Stepanov, Nikita ; Matveev, Nikolay ; Galinina, Olga et al. / A Lower Bound on the Average Identification Time in a Passive RFID System. Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings. Springer Verlag, 2018. pp. 524-534 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8d6069252b864803839bd8525035ac15,

title = "A Lower Bound on the Average Identification Time in a Passive RFID System",

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.",

author = "Nikita Stepanov and Nikolay Matveev and Olga Galinina and Andrey Turlikov",

year = "2018",

doi = "10.1007/978-3-030-01168-0_47",

language = "English",

isbn = "9783030011673",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "524--534",

booktitle = "Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings",

address = "Germany",

note = "International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networks and Systems Conference on Internet of Things and Smart Spaces ; Conference date: 27-08-2018 Through 29-08-2018",

}

Stepanov, N, Matveev, N, Galinina, O & Turlikov, A 2018, A Lower Bound on the Average Identification Time in a Passive RFID System. in Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11118 LNCS, Springer Verlag, pp. 524-534, International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networks and Systems Conference on Internet of Things and Smart Spaces, 27/08/18. https://doi.org/10.1007/978-3-030-01168-0_47

A Lower Bound on the Average Identification Time in a Passive RFID System. / Stepanov, Nikita; Matveev, Nikolay; Galinina, Olga et al.

Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings. Springer Verlag, 2018. p. 524-534 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11118 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

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

AU - Stepanov, Nikita

AU - Matveev, Nikolay

AU - Galinina, Olga

AU - Turlikov, Andrey

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-030-01168-0_47

DO - 10.1007/978-3-030-01168-0_47

M3 - Conference contribution

AN - SCOPUS:85054806849

SN - 9783030011673

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 524

EP - 534

BT - Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings

PB - Springer Verlag

T2 - International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networks and Systems Conference on Internet of Things and Smart Spaces

Y2 - 27 August 2018 through 29 August 2018

ER -

Stepanov N, Matveev N, Galinina O, Turlikov A. A Lower Bound on the Average Identification Time in a Passive RFID System. In Internet of Things, Smart Spaces, and Next Generation Networks and Systems - 18th International Conference, NEW2AN 2018, and 11th Conference, ruSMART 2018, Proceedings. Springer Verlag. 2018. p. 524-534. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-01168-0_47

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

Abstract

Publication series

Conference

Publication forum classification

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this