Research Article
One More Accuracy k-Anonymity Framework for LBS
Algorithm 1
JudgeUser //according to the first case.
| Input: | | | | | | , | | Output: flag | | Begin | | flag = true; | | L = | | if ( > 0) then //according to formula (7a) | | for (int i = 0; i < L.length; i++) | | ; | | t = s/v(i) | | ; | | if then | | delete ui; | | flag = false; | | find next user; | | return flag; | | if ( > 0) then //according to formula (7b) | | for (int i = 0; i< L.length; i++) | | ; | | total_s = total_s + s | | if then | | delete ui; | | flag = false; | | find next user; | | return flag; | | return flag; | | End |
|