Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Privacy and security in library RFID: issues, practices, and architectures
Proceedings of the 11th ACM conference on Computer and communications security
Dynamic Key-Updating: Privacy-Preserving Authentication for RFID Systems
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
Finding popular categories for RFID tags
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Tagmark: reliable estimations of RFID tags for business processes
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Passive RFID for intelligent transportation systems
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Fast RFID counting under unreliable radio channels
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
RFID Systems: Research Trends and Challenges
RFID Systems: Research Trends and Challenges
Cardinality Estimation for Large-Scale RFID Systems
IEEE Transactions on Parallel and Distributed Systems
Fast Capture—Recapture Approach for Mitigating the Problem of Missing RFID Tags
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
Estimation schemes of Radio Frequency IDentification (RFID) tag set cardinality are studied in this paper using Maximum Likelihood (ML) approach. We consider the estimation problem under the model of multiple independent reader sessions with detection errors due to unreliable radio communication links and/or collisions. In every reader session, both the detection error probability and the total number of tags are estimated. In particular, after the $$R$$ -th reader session, the number of tags detected in $$j$$ ( $$j=1,2,...,R$$ ) reader sessions out of $$R$$ sessions is updated, which we call observed evidence. Then, in order to maximize the likelihood function of the number of tags and the detection error probability given the observed evidences, we propose three different estimation methods depending on how to treat the discrete nature of the tag set cardinality. The performance of the proposed methods is evaluated under different system parameters and compared with that of the conventional method via computer simulations assuming flat Rayleigh fading environments and framed-slotted ALOHA based protocol.