Efficient memoryless protocol for tag identification (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Space-efficient online computation of quantile summaries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
A note on efficient aggregate queries in sensor networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Novel Anti-collision Algorithms for Fast Object Identification in RFID System
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
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
Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Cardinality Estimation for Large-scale RFID Systems
PERCOM '08 Proceedings of the 2008 Sixth Annual 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
How to Monitor for Missing RFID tags
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
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
Analyzing object detection quality under probabilistic coverage in sensor networks
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Energy-efficient polling protocols in RFID systems
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
A wirelessly-powered platform for sensing and computation
UbiComp'06 Proceedings of the 8th international conference on Ubiquitous Computing
Taxonomy and Challenges of the Integration of RFID and Wireless Sensor Networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
We consider the median estimation problem in a large-scale sensor augmented RFID system. The large-scale deployment of RFID technology has opened the door to innovative ways to integrate RFID and sensor technology. Sensor-tags are tags that can report over 50 types of physical information to a reader. The traditional way to obtain information from sensor-tags is to query each tag. When the number of tags is large, however, it is prohibitive to query tags individually due to the high delay. In this paper, we present a probabilistic algorithm to estimate the median of a set of sensor-RFID tags without individually querying each tag. The median estimation problem is solved using binary search. Our evaluation demonstrates that the median search algorithm exhibits high accuracy and reasonable time latency. Moreover, we also design an exact algorithm for the continuous median update problem. Our algorithm can incrementally compute the exact median in less time.