Skip to main content
. 2022 Sep 9;22(18):6839. doi: 10.3390/s22186839
Algorithm2: Candidate Node Joining a Cluster.
Input: K, M, S
Output: K cluster with N nodes
  •   1.

    Begin:

  •   2.

    repeat:

  •   3.

       if K ≠ 0 then

  •   4.

         for each member of M do

  •   5.

           Compute ηi using (1)

  •   6.

           Compute κi using (2)

  •   7.

           Compute δi using (3)

  •   8.

          Ti ⇐ δi

  •   9.

          CHmin ⇐ Min [T] using (4)

  •   10.

          CHmin ← Si

  •   11.

          Nmin ← Si

  •   12.

         end for

  •   13.

        else

  •   14.

          K ⇐ K + 1

  •   15.

          CHi ← Si

  •   16.

          Mi ← CHi

  •   17.

         end if

  •   18.

    until: All the members of S are clustered

  •   19.

    end