ACONET takes O(k.n) + O(k.n) + O(n) for single ant which collapses to: O(k.n) and for 'z' ants, it becomes O(z .(k.n))
So the overall complexity of ACONET is O(r.( z .(k.n)) + ([n.sup.2])), where [n.sup.2] represents pheromone evaporate operation.5.
The results of our proposed algorithm ACONET were compared with other popular clustering algorithms i.e.
The number of clusters produced by ACONET are less than CLPSO and MOPSO in most cases, moreover, we varied the number of nodes from 10 to 60 to conduct these experiments.
Whereas if the transmission range of nodes rises the number of cluster in each solution decreases, moreover in case of ACONET there are more optimized solution as compared to CLPSO and MOPSO.
In ACONET graph shows 49 clusters initially, which lead downwards up to 15 at the end when we increase the transmission range, it is because the network area is very large and the transmission range of nodes is comparatively small.
By comparing these results we conclude this section, ACONET provides less number of clusters as compare to other algorithms which leads to efficient clustering, moreover we can determine that ACONET performs better in case of dense environment.
3 shows the load balance factor in case of CLPSO, MOPSO and ACONET. The LBF is calculated by varying the transmission range from 100m to 600m while the grid size is 1km x 1km and the number of nodes are 30 and 40.