Reader scheduling for tag access in RFID systems

Arunabha Sen, Arun Das, Chenyang Zhou, Anisha Mazumder, Nathalie Mitton, Abdoul Aziz Mbacke

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

'Reader' and 'Tag' type devices are utilized in the Radio-Frequency IDentification technology for identification and tracking of objects. A tag can be 'read' by a reader when the tag is within the reader's sensing range. However, when tags are present in the intersection area of the sensing ranges of two or more readers, simultaneous activation of the readers may cause 'reader collision'. In order to ensure collision-free reading, a scheduling scheme is needed to read tags in the shortest possible time. We study this scheduling problem in a stationary setting and the reader minimization problem in a mobile setting. We show that the optimal schedule construction problem is NP-complete and provide an approximation algorithm and techniques that we evaluate through simulation.

Original languageEnglish (US)
Title of host publication2016 7th International Conference on the Network of the Future, NOF 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509046713
DOIs
StatePublished - Jan 6 2017
Event2016 7th International Conference on the Network of the Future, NOF 2016 - Buzios, RJ, Brazil
Duration: Nov 16 2016Nov 18 2016

Other

Other2016 7th International Conference on the Network of the Future, NOF 2016
CountryBrazil
CityBuzios, RJ
Period11/16/1611/18/16

Fingerprint

Radio frequency identification (RFID)
Scheduling
Approximation algorithms
Computational complexity
Identification (control systems)
Chemical activation

Keywords

  • distributed algorithms
  • reader anticollision problem
  • ressource allocation scheduling
  • RFID Radio Frequency IDentification

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Sen, A., Das, A., Zhou, C., Mazumder, A., Mitton, N., & Mbacke, A. A. (2017). Reader scheduling for tag access in RFID systems. In 2016 7th International Conference on the Network of the Future, NOF 2016 [7810112] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/NOF.2016.7810112

Reader scheduling for tag access in RFID systems. / Sen, Arunabha; Das, Arun; Zhou, Chenyang; Mazumder, Anisha; Mitton, Nathalie; Mbacke, Abdoul Aziz.

2016 7th International Conference on the Network of the Future, NOF 2016. Institute of Electrical and Electronics Engineers Inc., 2017. 7810112.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sen, A, Das, A, Zhou, C, Mazumder, A, Mitton, N & Mbacke, AA 2017, Reader scheduling for tag access in RFID systems. in 2016 7th International Conference on the Network of the Future, NOF 2016., 7810112, Institute of Electrical and Electronics Engineers Inc., 2016 7th International Conference on the Network of the Future, NOF 2016, Buzios, RJ, Brazil, 11/16/16. https://doi.org/10.1109/NOF.2016.7810112
Sen A, Das A, Zhou C, Mazumder A, Mitton N, Mbacke AA. Reader scheduling for tag access in RFID systems. In 2016 7th International Conference on the Network of the Future, NOF 2016. Institute of Electrical and Electronics Engineers Inc. 2017. 7810112 https://doi.org/10.1109/NOF.2016.7810112
Sen, Arunabha ; Das, Arun ; Zhou, Chenyang ; Mazumder, Anisha ; Mitton, Nathalie ; Mbacke, Abdoul Aziz. / Reader scheduling for tag access in RFID systems. 2016 7th International Conference on the Network of the Future, NOF 2016. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{faa32a89260d4240a60195e03e304fc3,
title = "Reader scheduling for tag access in RFID systems",
abstract = "'Reader' and 'Tag' type devices are utilized in the Radio-Frequency IDentification technology for identification and tracking of objects. A tag can be 'read' by a reader when the tag is within the reader's sensing range. However, when tags are present in the intersection area of the sensing ranges of two or more readers, simultaneous activation of the readers may cause 'reader collision'. In order to ensure collision-free reading, a scheduling scheme is needed to read tags in the shortest possible time. We study this scheduling problem in a stationary setting and the reader minimization problem in a mobile setting. We show that the optimal schedule construction problem is NP-complete and provide an approximation algorithm and techniques that we evaluate through simulation.",
keywords = "distributed algorithms, reader anticollision problem, ressource allocation scheduling, RFID Radio Frequency IDentification",
author = "Arunabha Sen and Arun Das and Chenyang Zhou and Anisha Mazumder and Nathalie Mitton and Mbacke, {Abdoul Aziz}",
year = "2017",
month = "1",
day = "6",
doi = "10.1109/NOF.2016.7810112",
language = "English (US)",
booktitle = "2016 7th International Conference on the Network of the Future, NOF 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Reader scheduling for tag access in RFID systems

AU - Sen, Arunabha

AU - Das, Arun

AU - Zhou, Chenyang

AU - Mazumder, Anisha

AU - Mitton, Nathalie

AU - Mbacke, Abdoul Aziz

PY - 2017/1/6

Y1 - 2017/1/6

N2 - 'Reader' and 'Tag' type devices are utilized in the Radio-Frequency IDentification technology for identification and tracking of objects. A tag can be 'read' by a reader when the tag is within the reader's sensing range. However, when tags are present in the intersection area of the sensing ranges of two or more readers, simultaneous activation of the readers may cause 'reader collision'. In order to ensure collision-free reading, a scheduling scheme is needed to read tags in the shortest possible time. We study this scheduling problem in a stationary setting and the reader minimization problem in a mobile setting. We show that the optimal schedule construction problem is NP-complete and provide an approximation algorithm and techniques that we evaluate through simulation.

AB - 'Reader' and 'Tag' type devices are utilized in the Radio-Frequency IDentification technology for identification and tracking of objects. A tag can be 'read' by a reader when the tag is within the reader's sensing range. However, when tags are present in the intersection area of the sensing ranges of two or more readers, simultaneous activation of the readers may cause 'reader collision'. In order to ensure collision-free reading, a scheduling scheme is needed to read tags in the shortest possible time. We study this scheduling problem in a stationary setting and the reader minimization problem in a mobile setting. We show that the optimal schedule construction problem is NP-complete and provide an approximation algorithm and techniques that we evaluate through simulation.

KW - distributed algorithms

KW - reader anticollision problem

KW - ressource allocation scheduling

KW - RFID Radio Frequency IDentification

UR - http://www.scopus.com/inward/record.url?scp=85015160952&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015160952&partnerID=8YFLogxK

U2 - 10.1109/NOF.2016.7810112

DO - 10.1109/NOF.2016.7810112

M3 - Conference contribution

AN - SCOPUS:85015160952

BT - 2016 7th International Conference on the Network of the Future, NOF 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -