Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/55569
Title: RFID cardinality estimation with blocker tags
Authors: Liu, X
Xiao, B 
Li, K
Wu, J
Liu, AX
Qi, H
Xie, X
Keywords: Blocker tags
RFID estimation
RFID privacy
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: Proceedings - IEEE INFOCOM, v. 26, 7218548, p. 1679-1687 How to cite?
Abstract: The widely used RFID tags impose serious privacy concerns as a tag responds to queries from readers no matter they are authorized or not. The common solution is to use a commercially available blocker tag which behaves as if a set of tags with known blocking IDs are present. The use of blocker tags makes RFID estimation much more challenging as some genuine tag IDs are covered by the blocker tag and some are not. In this paper, we propose REB, the first RFID estimation scheme with the presence of blocker tags. REB uses the framed slotted Aloha protocol specified in the C1G2 standard. For each round of the Aloha protocol, REB first executes the protocol on the genuine tags and the blocker tag, and then virtually executes the protocol on the known blocking IDs using the same Aloha protocol parameters. The basic idea of REB is to conduct statistically inference from the two sets of responses and estimate the number of genuine tags. We conduct extensive simulations to evaluate the performance of REB, in terms of time-efficiency and estimation reliability. The experimental results reveal that our REB scheme runs tens of times faster than the fastest identification protocol with the same accuracy requirement.
URI: http://hdl.handle.net/10397/55569
ISBN: 9781479983810
ISSN: 0743-166X
DOI: 10.1109/INFOCOM.2015.7218548
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

9
Last Week
0
Last month
Citations as of Aug 14, 2017

Page view(s)

39
Last Week
1
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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