CC2: Defending Hybrid Worm on Mobile Networks with Two-Dimensional Circulation Control
Algorithm 1
Security-based label propagation algorithm.
Require:
Contact history from information collector;
Ensure:
Community structure ;
Step 1. Initialize the community label. Each node i in graph G contains a feature vector , where l represents the community label, b represents the belonging degree, L represents the transition probability of l, t represents the number of iterations. For example, the feature pair of i is means the initial label of node i is itself and the belonging degree equals to one;
Step 2. Set ;
Step 3. Arrange each in a random order and assign them to V;
Step 4. For each ,, calculate the belonging degree of the adjacent community label as ;
Step 5. For each , if exists s.t. , then replace with , and remain unchanged. Else stop and jump to Final;
