Adaptive splitting and pre-signaling for RFID tag anti-collision
Computer Communications
Featherlight information network with delay-endurable RFID support (FINDERS)
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Anonymous cardinality estimation in RFID systems with multiple readers
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficient tag identification in mobile RFID systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient continuous scanning in RFID systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Energy efficient algorithms for the RFID estimation problem
INFOCOM'10 Proceedings of the 29th conference on Information communications
Counting RFID tags efficiently and anonymously
INFOCOM'10 Proceedings of the 29th conference on Information communications
Identifying the missing tags in a large RFID system
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Energy-efficient polling protocols in RFID systems
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
ACSP: A novel security protocol against counting attack for UHF RFID systems
Computers & Mathematics with Applications
Every bit counts: fast and scalable RFID estimation
Proceedings of the 18th annual international conference on Mobile computing and networking
Efficient median estimation for large-scale sensor RFID systems
International Journal of Sensor Networks
Low cost crowd counting using audio tones
Proceedings of the 10th ACM Conference on Embedded Network Sensor Systems
Generalized energy-efficient algorithms for the RFID estimation problem
IEEE/ACM Transactions on Networking (TON)
Continuous scanning with mobile reader in RFID systems: an experimental study
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Efficient protocols for identifying the missing tags in a large RFID system
IEEE/ACM Transactions on Networking (TON)
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
Counting or estimating the number of tags is crucial for large-scale RFID systems. The use of multiple readers was recently proposed to improve the efficiency and effectiveness in reading RFID tags. Due to the long processing time, tag identification based counting schemes are often impractical, especially when tags are attached to moving objects. The existing estimation based schemes, on the other hand, suffer from the multiple-reading problem. To address this issue, we propose the Lottery Frame (LoF) scheme, a replicate-insensitive estimation protocol, that is able to eliminate multiple-readings. We show the high accuracy, short processing time and low overhead of the proposed LoF scheme through analysis and simulations.