Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Adaptive Cleaning for RFID Data Streams

Shawn Ryan Jeffery, Minos Garofalakis and Michael Franklin

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2006-29
March 27, 2006

http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-29.pdf

A major impediment to the widespread adoption of RFID technology is the unreliability of the data streams produced by RFID readers; a 30% drop rate is not uncommon for RFID deployments. To compensate, most RFID middleware systems provide a ¿smoothing filter¿, a sliding-window aggregate that interpolates for lost readings. Typically, these middleware systems require the application to fix the size of the smoothing window in order to produce clean RFID data. Window-size selection, however, is a non-trivial problem: the window must be large enough to smooth lost readings but small enough to accurately capture tag movement. Furthermore, the ideal size may change over the course of the RFID deployment. In this paper, we propose SMURF, the first declarative, adaptive smoothing filter for RFID data cleaning. SMURF models the unreliability of RFID readings by viewing RFID streams as a statistical sample of tags in the physical world, and exploits techniques grounded in sampling theory to drive its cleaning processes. Through the use of tools such as binomial sampling and null-estimators, SMURF continuously adapts the smoothing window size in a principled manner to provide accurate RFID data to applications.


BibTeX citation:

@techreport{Jeffery:EECS-2006-29,
    Author = {Jeffery, Shawn Ryan and Garofalakis, Minos and Franklin, Michael},
    Title = {Adaptive Cleaning for RFID Data Streams},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2006},
    Month = {Mar},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-29.html},
    Number = {UCB/EECS-2006-29},
    Abstract = {A major impediment to the widespread adoption of RFID technology is the unreliability of the data streams produced by RFID readers; a 30% drop rate is not uncommon for RFID deployments. To compensate, most RFID middleware systems provide a ¿smoothing filter¿, a sliding-window aggregate that interpolates for lost readings. Typically, these middleware systems require the application to fix the size of the smoothing window in order to produce clean RFID data. Window-size selection, however, is a non-trivial problem: the window must be large enough to smooth lost readings but small enough to accurately capture tag movement. Furthermore, the ideal size may change over the course of the RFID deployment.

In this paper, we propose SMURF, the first declarative, adaptive smoothing filter for RFID data cleaning. SMURF models the unreliability of RFID readings by viewing RFID streams as a statistical sample of tags in the physical world, and exploits techniques grounded in sampling theory to drive its cleaning processes. Through the use of tools such as binomial sampling and -estimators, SMURF continuously adapts the smoothing window size in a principled manner to provide accurate RFID data to applications.}
}

EndNote citation:

%0 Report
%A Jeffery, Shawn Ryan
%A Garofalakis, Minos
%A Franklin, Michael
%T Adaptive Cleaning for RFID Data Streams
%I EECS Department, University of California, Berkeley
%D 2006
%8 March 27
%@ UCB/EECS-2006-29
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-29.html
%F Jeffery:EECS-2006-29