Optimal scheduling for networks of RFID readers

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Devising switching schemes for networks of colliding and correlated RFID readers is a core challenge in the deployment of RFID networks. We derive optimal scheduling schemes for readers in RFID networks In four cases of practical importance. Most other cases can be reduced to a combination of these basic cases. © JFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Deolalikar, V., Recker, J., Mesarina, M., & Pradhan, S. (2005). Optimal scheduling for networks of RFID readers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3823 LNCS, pp. 1025–1035). https://doi.org/10.1007/11596042_105

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free