By Topic

Exploiting proximity readers for statistical cleaning of unreliable RFID data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xingqiang Zhou ; Coll. of Inf. Sci. & Technol., Dalian Maritime Univ., Dalian, China ; Rong Chen

Standard RFID data cleaning provides a smoothing filter that interpolate for lost readings and aggregate data via a sliding-window. Existing cleaning techniques work well under various conditions, but they mainly focus an individual reader and have disregarded the very high cost of cleaning in a real application that have thousands of readers and millions of tags. Given the enormous volume of information, diverse sources of error, and rapid response requirements, setting the window size is still a challenging task. In this paper, we propose to use proximity readers, common in real RFID applications, to enhance adaptive cleaning of massive RFID data sets. Considering the need for effective cleaning with minimum costs, we extend the multi-tag cleaning mechanism of the SMURF. Experiments are also carried out to verify the effectiveness of our algorithm. The promising experimental results reveal that the new adaptive cleaning mechanism is effective for lost readings and redundant RFID data.

Published in:

Ubiquitous and Future Networks (ICUFN), 2011 Third International Conference on

Date of Conference:

15-17 June 2011