Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Transmission control scheme for fast RFID object identification
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification
IEEE Transactions on Parallel and Distributed Systems
An empirical study of UHF RFID performance
Proceedings of the 14th ACM international conference on Mobile computing and networking
Design and analysis of framed aloha based RFID anti-collision algorithms
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 0.00 |
The anti-collision algorithm is an important part of the Radio-Frequency Identification (RFID) system. Of the various possible algorithms, the Framed Aloha based (FA) algorithms have been most widely used due to their simplicity and robustness. Previous studies have focused mainly on the tag population estimation, choosing the frame size based on the classical results of Random Access (RA) systems. We show that a new theory is needed for algorithm design for RFID systems, because RFID and RA systems are fundamentally different. The Philips RFID system is studied in this paper. We model the reading process as a Markov Chain and derive the optimal reading strategy by first-passage-time analysis. The optimal frame sizes are derived analytically and numerically.