The third rule coversdescribes situations where highernodes with leveraged weight nodesvalues, thatwhich are not clusterheadcluster centers, attract surrounding nodes with lesslower weightweights. This behavior can lead to fragmented clusters without a cluster center. In order to avoid a fragmented clusterclusters, thisthe node with higher weight value is supposed to successively decreasesdecreasing its own weight,finallywith connectingthe objective to ancorrect existentthe clusterfragmentation by allowing the other nodes to reconfigure acccording the rules. <syntaxhighlight lang="java" line="1">
if max(W(N(n))) <= w_n && w_n != MAX
w_n = w_n - 1;
Line 42:
=== Rule 4 ===
The fourth rule describesresolves the situation where two cluster centers connect in 1-hop neighborhood and need to decide which cluster center should continue its role as cluster center. In accordance of a certain criterion one cluster center remains while the other clusterhead hierarchized in 1-hop neighborhood to that new cluster center. The choise of the criterion is depending on the application scenario and on the information available. In case of networks, one can assume that each node carries beside the weight also an unique ID number, which an be used in order to resolve the conflict.<syntaxhighlight lang="java" line="1">
if max(W(N(n)) == MAX && w_n == MAX
w_n = randomly choose a node from set (max(W(N(n)),w_n);
