Estimate the Tag density algorithm 1 Tag density estimation algorithm ° Algorithm design 1: INPUT: Vi=ni, 1, ni, 2,.,ni, s: the vectors for refer- ence tag densities pi(i=1.h) 2: PROCEDIR 3: Set the reader's power to various levels Get nc in various power levels, assemble as a s to get the average value of the number of identifie vector Vcle as nimble them as a vector V Ⅴ ery practical and fully compatible with EPC C1G2 4: for i e [1, h) do standard 5: Compute the similarity between V and Vi as follows Does not require to obtain Compare the similarity between y and the any low-level parameters previously stored patterns. -;v2)-n, for rfid readers 7: We use the k-nearest neighbor method to Find estimate the tag density based on k-nearest say 8: reterence tag densities here 1/(1-sim(V,V)+e) (∈>0) 11/(1-sim(V,V)+e) 9: OUTPUT: The estimated tag density pEstimate the Tag Density • Algorithm Design • Very practical and fully compatible with EPC C1G2 standard • Does not require to obtain any low-level parameters for RFID readers. Get nc in various power levels, assemble as a vector V. Compare the similarity between V and the previously stored patterns. We use the k-nearest neighbor method to estimate the tag density based on k-nearest reference tag densities