Protecting Check-In Data Privacy in Blockchain Transactions with Preserving High Trajectory Pattern Utility

Algorithm 5

The dummy location selection algorithm.

Input: generalized location type quantity array S, real sensitive location , privacy protection threshold k, location queue L;

Output: generalized location candidate array .

1. Initialize []=0, i[1|S|];

2. while lens ()<k-1 do

3. for each location type &&<= S [] do

4.  if lens ()==0 then

5.   Select the location furthest from the real sensitive location from the generalized locations in and add it to ;

6.  else

7.   Select the location with the maximum Score in and add it to ;

8. Return ;