Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Efficient Object Identification with Passive RFID Tags
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
Proceedings of the 2004 international symposium on Low power electronics and design
LANDMARC: indoor location sensing using active RFID
Wireless Networks - Special issue: Pervasive computing and communications
An Enhanced Dynamic Framed Slotted ALOHA Algorithm for RFID Tag Identification
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
A Secure and Efficient RFID Protocol that could make Big Brother (partially) Obsolete
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Adaptive splitting protocols for RFID tag collision arbitration
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Intelligent Query Tree (IQT) Protocol to Improve RFID Tag Read Efficiency
ICIT '06 Proceedings of the 9th International Conference on Information Technology
Energy-Aware Tag Anti-Collision Protocols for RFID Systems
PERCOM '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications
A framework for fast RFID tag reading in static and mobile environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cardinality Estimation for Large-scale RFID Systems
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
How to Monitor for Missing RFID tags
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
On the energy consumption of Pure and Slotted Aloha based RFID anti-collision protocols
Computer 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
Identification-free batch authentication for RFID tags
ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
An anti-collision algorithm using two-functioned estimation for RFID tags
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Probabilistic missing-tag detection and energy-time tradeoff in large-scale RFID systems
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Efficient median estimation for large-scale sensor RFID systems
International Journal of Sensor Networks
Fast tag searching protocol for large-scale RFID systems
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Future RFID technologies will go far beyond today's widely-used passive tags. Battery-powered active tags are likely to gain more popularity due to their long operational ranges and richer on-tag resources. With integrated sensors, these tags can provide not only static identification numbers but also dynamic, real-time information such as sensor readings. This paper studies a general problem of how to design efficient polling protocols to collect such real-time information from a subset M of tags in a large RFID system. We show that the standard, straightforward polling design is not energy-efficient because each tag has to continuously monitor the wireless channel and receive O(|M|) tag IDs, which is energy-consuming. Existing work is able to cut the amount of data each tag has to receive by half through a coding design. In this paper, we propose a tag-ordering polling protocol (TOP) that can reduce per-tag energy consumption by more than an order of magnitude. We also reveal an energy-time tradeoff in the protocol design: per-tag energy consumption can be reduced to O(1) at the expense of longer execution time of the protocol. Finally, we apply partitioned Bloom filters to enhance the performance of TOP, such that it can achieve much better energy efficiency without degradation in protocol execution time.