Research Article
Graph Embedding-Based Sensitive Link Protection in IoT Systems
Algorithm 1
Generate privacy graph by adding edges.
Input:: the original graph | : the adjacency matrix of | : the set of sensitive links | : the neighbor nodes set of | : the maximum number of edges added for each sensitive link | Output:: the adjacency matrix of privacy graph | 1:fordo | 2: find the neighbor nodes sets and | 3: fordo | 4: if and then | 5: if the number of edges added for then | 6: | 7: end if | 8: end if | 9: end for | 10:end for | 11:return take the modified as |
|