Please use this identifier to cite or link to this item: https://doi.org/10.1145/2500423.2500431
Title: Understanding RFID counting protocols
Authors: Chen, B.
Zhou, Z. 
Yu, H. 
Keywords: Counting
Lower bounds
Rfid
Rfid counting protocols
Twophase
Issue Date: 2013
Citation: Chen, B.,Zhou, Z.,Yu, H. (2013). Understanding RFID counting protocols. Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM : 291-302. ScholarBank@NUS Repository. https://doi.org/10.1145/2500423.2500431
Abstract: Counting the number of RFID tags, or RFID counting, is needed by a wide array of important wireless applications. Motivated by its paramount practical importance, researchers have developed an impressive arsenal of techniques to improve the performance of RFID counting (i.e., to reduce the time needed to do the counting). This paper aims to gain deeper and fundamental insights in this subject to facilitate future research on this topic. As our central thesis, we find out that the overlooked key design aspect for RFID counting protocols to achieve near-optimal performance is a conceptual separation of a protocol into two phases. The first phase uses small overhead to obtain a rough estimate, and the second phase uses the rough estimate to further achieve an accuracy target. Our thesis also indicates that other performanceenhancing techniques or ideas proposed in the literature are only of secondary importance. Guided by our central thesis, we manage to design near-optimal protocols that are more efficient than existing ones and simultaneously simpler than most of them. © 2013 by the Association for Computing Machinery, Inc.
Source Title: Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM
URI: http://scholarbank.nus.edu.sg/handle/10635/78412
ISBN: 9781450319997
DOI: 10.1145/2500423.2500431
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.