A K-Means and Ant Colony Optimization-Based Routing in Underwater Sensor Networks

Algorithm 1

Input:

Output: Centroid position of all clusters:

Step1: random centroids are selected from and these centroids are located into initial centroid set

Step2: centroids are located into initial centroid set

   Other sensor nodes compute the distance from these centroids, the centroid with minimum distance is selected to cluster

Step3: Centroid position of each cluster is calculated by Equation (8)

Step4: is calculated by Equation (10), and decide

   If not, go to Step 2.

   Otherwise, iteration is stopped, and output