KHOPCA clustering algorithm: Difference between revisions

Content deleted Content added
No edit summary
No edit summary
Line 30:
=== Rule 2 ===
 
The second rule deals with the situation where isolated nodes are clusterhead-less on the minimum weight level. In that case a node declares itself as clusterheadcluster center.<syntaxhighlight lang="java" line="1">
if max(W(N(n)) == MIN & w_n == MIN
w_n = MAX;
Line 42:
 
=== Rule 4 ===
The fourth rule resolves 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 clusterheadcluster center is 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);