The adaptive probability formalized in Adapt- is developed based on the remaining number of SNs and optimal clustering , yet does not implement the probabilistic ratios of energy and distance factors in the network. Furthermore, Adapt- does not localize cluster-heads in the first round properly because of its reliance on distance computations defined in LEACH, that might result in uneven distribution of cluster-heads in the WSN area and hence might at some rounds yield inefficient consumption of energy. This paper utilizes \nolinebreak{\small{-}means\small{++}} and Adapt- to propose \nolinebreak{\small{-}means\small{++}} clustering algorithm that better manages the distribution of cluster-heads and produces an enhanced performance. The algorithm employs an optimized cluster-head election probability developed based on energy-based and distance-based quality probabilities along with the adaptive probability , utilizing the energy and distance optimality factors. Furthermore, the algorithm utilizes the optimal clustering derived in Adapt- to perform adaptive clustering through \nolinebreak{\small{-}means\small{++}}. The proposed \nolinebreak{{\small{-}}means{\small{++}}} is compared with the energy-based algorithm \nolinebreak{{\small{-}}means{\small{++}}} and distance-based \nolinebreak{{\small{-}}means{\small{++}}} algorithm, and has shown an optimized performance in term of residual energy and stability period of the network.
View on arXiv