Algorithm 6.

(Associative) SOINN+ Node deletion

1: for i in A do

2:     $U(i)\leftarrow \frac{IT(i)}{WT(i)}$    // Update unutilities of all nodes (Equation 10).

3: end for

4: $\mathcal{U}\leftarrow$ Set of unutilities of all nodes with edges

5: $\mathcal{I}\leftarrow$ Set of unconnected nodes

6: ${\omega }_{node}\leftarrow median(\mathcal{U})+2·sMAD(\mathcal{U})$    // (Equation 11)

7: $R_{noise}\leftarrow \frac{\left|\mathcal{I}\right|}{\left|A\right|}$

8: ${\lambda }_{node}\leftarrow {\overline{\mathcal{U}}}_{del}·\frac{\left|{\mathcal{U}}_{del}\right|}{\left|{\mathcal{U}}_{del}\right|+|A\backslash \mathcal{I}|}+{\omega }_{node}·(1-\frac{\left|{\mathcal{U}}_{del}\right|}{\left|{\mathcal{U}}_{del}\right|+|A\backslash \mathcal{I}|})·(1-R_{noise})$    // (Equation 12)

9: for i in A do

10:     if |E| > 1 and U(i) > λnode and i has no edges then

11:          A ← A\{i}    // Delete the node.

12:           (A-SOINN+): Update $\left|{\mathcal{U}}_{del}\right|$, ${\mathcal{U}}_{del}^{sum}$, and ${\overline{\mathcal{U}}}_{del}$

13:     end if

14: end for

15: for i in A do

16:     IT(i) ← IT(i) + 1    // Increment the idle time of each node.

17: end for