Algorithm 4. Irresponsible algorithm based on dissimilarity metric.

1: Whenever a message g is received

2: If g is new:

3: Retrieve neighboring list from g

4: Calculate aik, ai, ak

5: Calculate p as $p=\exp \left(-\frac{n_b\left(1-(D{M}_{ik}\right)}{v}\right)$

6: If p ≥ Rand [0,1]

7:  Include neighboring list in g

8:  Rebroadcast g

9: Else:

10:   Eliminate g

11:  End if

12: Else:

13:  Eliminate g

12: End if