A Temporal and Spatial Data Redundancy Processing Algorithm for RFID Surveillance Data

Table 1

Weaknesses of existing approaches for filtering redundant RFID data.

Approach	Weakness
RFID Cube [11]	Needs to wait for all readings to be completed before duplicate readings can be filtered
Sliding window [12]	Subject to a selection of parameters and needs to scan along the sliding windows for every new reading
Extensible receptor Stream Processing (ESP) and pipelined data cleaning (PDC) [14, 15]	Complex filtering framework, delayed process, and not suitable for dynamic tag filtering
Finite state machine [16]	Limited by scenario and lack of generalization ability
Dynamic Bayesian networks (DBN) [17]	Cleaning effect of the dynamic tag is not obvious
Bloom filter [19, 20]	Does not allow deletion and filtering in a single dimension