Research Article
VSMURF: A Novel Sliding Window Cleaning Algorithm for RFID Networks
Pseudocode 1
Adaptive sliding window cleaning algorithm.
Input: = set of all observed tag IDs | = required completeness confidence | = the maximum threshold of tag’s speed | = the radius of reader’s detection range | = the frequency of reader’s detection | Output: = set of all present tag IDs | Initialize: | While do | For ( in ) do | | if() | | Else | | End if | If(tagExist()) | Output i | End if | | | If() | | Else if() | | Else if() | | Else | | End if | End for | End while |
|