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

Algorithm 1

TDBF.

Input: RFID data x: x.tid, x.Time, x.RSS.

Output: Whether x is redundant data.

1: BEGIN

2: //New data arrives

3: FOR (i = 1; i k; i ++)

4:      //Hash mapping the tag ID

5: FOR (i = 1; i k; i ++)

6: IF    //If the time value in the mapped array is the initial value of 0 and the RSS value is greater than a threshold within the specified range

7: Update TDBF (x.Time, x.RSS)       // update TDBF

8: Send x to the event // send data to the event module

9: break

10: ELSE IF   // If the data x in the range and the previously stored data have a time interval of

11: Update TDBF(x.Time, x.RSS)

12: Send x to the event

13: break

14: ELSE IF       // If the newly arrived data has a higher RSS value

15: Update TDBF (x.Time, x.RSS)

16: Send x to the event

17: break

18: ELSE IF

19: END FOR

20: Drop x  // this data is redundant data, directly drop

21: END