Research Article
Privacy-Aware Task Assignment for IoT Audit Applications on Collaborative Edge Devices
Algorithm 1
Greedy search-based task assignment.
| Input: | | T: the tasks set; D: the edge devices set; B: the lower bound vector; | | C: the compatibility matrix; E: the evaluation matrix; S: the edge device selection vector. | | Output: | | A: the task assignment matrix. | (1) | for each task tj in T do | (2) | for each edge device di in D do | (3) | if E[i, j] = 1 then | (4) | if S[i] = 1 then; | (5) | skip it and examine the next edge device; | (6) | else | (7) | V ← C[i, j]; | (8) | end if | (9) | end if | (10) | end for | (11) | SV ← sorting V based on privacy compatibility degree; | (12) | Select Top-B[j] edge devices from SV; | (13) | Update A[i, j] and S[i]; | (14) | end for | (15) | return A; |
|