The increasing use of RFID tags in many applications have brought forth valid concerns of privacy and anonymity among users. One of the primary concerns with RFID tags is their ability to track an individually tagged entity. While this capability is currently thought to be necessary for supporting some features of RFID systems, such practice can lead to potential privacy violations. In this paper, we propose a privacy-preserving scheme that enables anonymous estimation of the cardinality of a dynamic set of RFID tags, while allowing the set membership to vary in both the spatial and temporal domains. In addition, the proposed scheme can identify the dynamics of the changes in the tag set population. The main idea of the scheme is to avoid explicit identification of tags. We demonstrate that the proposed scheme is highly adaptive and can accurately estimate tag populations across many orders of magnitude, ranging from a few tens to millions of tags. The associated probing latency is also substantially lower (les 10%) than that of the schemes which require explicit tag identification. We also show that our proposed scheme performs well even in highly dynamic environments, where the tag set keeps changing rapidly.
[1]
Harald Vogt,et al.
Efficient Object Identification with Passive RFID Tags
,
2002,
Pervasive.
[2]
Murali S. Kodialam,et al.
Fast and reliable estimation schemes in RFID systems
,
2006,
MobiCom '06.
[3]
Peter H. Cole,et al.
Synchronization of RFID readers for dense RFID reader environments
,
2006,
International Symposium on Applications and the Internet Workshops (SAINTW'06).
[4]
Klaus Finkenzeller,et al.
RFID Handbook: Radio-Frequency Identification Fundamentals and Applications
,
2000
.
[5]
Joongheon Kim,et al.
Effect of localized optimal clustering for reader anti-collision in RFID networks: fairness aspects to the readers
,
2005,
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005..
[6]
Jianping Pan,et al.
Fast and accurate traffic matrix measurement using adaptive cardinality counting
,
2005,
MineNet '05.
[7]
P. Flajolet,et al.
Loglog counting of large cardinalities
,
2003
.
[8]
Kyu-Young Whang,et al.
A linear-time probabilistic counting algorithm for database applications
,
1990,
TODS.