Research Article
Privacy-Aware Task Assignment for IoT Audit Applications on Collaborative Edge Devices
Algorithm 2
KM algorithm-based task assignment.
| Input: | | T: the tasks set; D: the edge devices set; B: the lower bound vector; | | C: the privacy compatibility matrix; E: the evaluation matrix. | | Output: | | Success: A; failure: no feasible A is obtained. | (1) | for each edge device di in D do | (2) | for each task tj in T do | (3) | if E[i, j] = 1 then | (4) | C[i, j] ← mpc − C[i, j]; | (5) | else | (6) | C[i, j] ← ; | (7) | end if | (8) | end for | (9) | end for | (10) | for each edge device di in D do | (11) | cindex ← 0; | (12) | for each task tj in T do | (13) | while B[j] > 0 do | (14) | [i, cindex++] ← C[i, j]; | (15) | B[j] ← B[j] − 1; | (16) | end while | (17) | end for | (18) | end for | (19) | if m > then | (20) | Add m − virtual columns to , and set their corresponding element values to 0; | (21) | end if | (22) | H ← KM(); | (23) | Form the assignment matrix A based on H; | (24) | if there is any incorrect assignment in A then | (25) | return Failure | (26) | end if | (27) | if for all columns of matrix A satisfy then | (28) | return Success | (29) | else | (30) | return Failure | (31) | end if |
|