| Algorithm 4. Node Dormancy Algorithm (Large Cluster of Unstable Period) |
| Inputs: (1) nodes of cluster C |
| (2) size of cluster C: NO |
| (3) number of surviving nodes: n |
| (4) optimal number of clusters: k |
| Result: dormant nodes of cluster C |
| 1: for i = 1 → NO |
| 2: calculate the dormancy factor of node i, Sidor |
| 3: end for |
| 4: calculate node dormancy ratio, P |
| 5: sort the dormancy factor set from small to large |
| 6: put the nodes corresponding to the previous P dormancy factors into dormancy |