TY - GEN
T1 - Analog on-tag hashing
T2 - 23rd Annual International Conference on Mobile Computing and Networking, MobiCom 2017
AU - Yang, Lei
AU - Lin, Qiongzheng
AU - Duan, Chunhui
AU - An, Zhenlin
N1 - Publisher Copyright:
© 2017 Copyright held by the owner/author(s).
PY - 2017/10/4
Y1 - 2017/10/4
N2 - Deployment of billions of Commercial off-the-shelf (COTS) RFID tags has drawn much of the attention of the research community because of the performance gaps of current systems. In particular, hash-enabled protocol (HEP) is one of the most thoroughly studied topics in the past decade. HEPs are designed for a wide spectrum of notable applications (e.g., missing detection) without need to collect all tags. HEPs assume that each tag contains a hash function, such that a tag can select a random but predicable time slot to reply with a one-bit presence signal that shows its existence. However, the hash function has never been implemented in COTS tags in reality, which makes HEPs a 10-year untouchable mirage. This work designs and implements a group of analog on-tag hash primitives (called Tash) for COTS Gen2-compatible RFID systems, which moves prior HEPs forward from theory to practice. In particular, we design three types of hash primitives, namely, tash function, tash table function and tash operator. All of these hash primitives are implemented through selective reading, which is a fundamental and mandatory functionality specified in Gen2 protocol, without any hardware modification and fabrication. We further apply our hash primitives in two typical HEP applications (i.e., cardinality estimation and missing detection) to show the feasibility and effectiveness of Tash. Results from our prototype, which is composed of one Impin J reader and 3, 000 Alien tags, demonstrate that the new design lowers 60% of the communication overhead in the air. The tash operator can additionally introduce an overhead drop of 29.7%.
AB - Deployment of billions of Commercial off-the-shelf (COTS) RFID tags has drawn much of the attention of the research community because of the performance gaps of current systems. In particular, hash-enabled protocol (HEP) is one of the most thoroughly studied topics in the past decade. HEPs are designed for a wide spectrum of notable applications (e.g., missing detection) without need to collect all tags. HEPs assume that each tag contains a hash function, such that a tag can select a random but predicable time slot to reply with a one-bit presence signal that shows its existence. However, the hash function has never been implemented in COTS tags in reality, which makes HEPs a 10-year untouchable mirage. This work designs and implements a group of analog on-tag hash primitives (called Tash) for COTS Gen2-compatible RFID systems, which moves prior HEPs forward from theory to practice. In particular, we design three types of hash primitives, namely, tash function, tash table function and tash operator. All of these hash primitives are implemented through selective reading, which is a fundamental and mandatory functionality specified in Gen2 protocol, without any hardware modification and fabrication. We further apply our hash primitives in two typical HEP applications (i.e., cardinality estimation and missing detection) to show the feasibility and effectiveness of Tash. Results from our prototype, which is composed of one Impin J reader and 3, 000 Alien tags, demonstrate that the new design lowers 60% of the communication overhead in the air. The tash operator can additionally introduce an overhead drop of 29.7%.
KW - EPCGlobal Gen2
KW - Hash function
KW - Hash table function
KW - RFID
UR - http://www.scopus.com/inward/record.url?scp=85034061155&partnerID=8YFLogxK
U2 - 10.1145/3117811.3117835
DO - 10.1145/3117811.3117835
M3 - Conference contribution
AN - SCOPUS:85034061155
T3 - Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM
SP - 301
EP - 314
BT - MobiCom 2017 - Proceedings of the 23rd Annual International Conference on Mobile Computing and Networking
PB - Association for Computing Machinery
Y2 - 16 August 2017 through 20 August 2017
ER -