Pcmax-Means++: Adapt-P Driven by Energy and Distance Quality Probabilities Based on -Means++ for the Stable Election Protocol (SEP)
Abstract
The adaptive probability Padp formalized in Adapt-P is developed based on the remaining number of SNs ζ and optimal clustering max, yet Padp does not implement the probabilistic ratios of energy and distance factors in the network. Furthermore, Adapt-P 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 k-means++ and Adapt-P to propose Pc max-means++ clustering algorithm that better manages the distribution of cluster-heads and produces an enhanced performance. The algorithm employs an optimized cluster-head election probability Pc developed based on energy-based Pη(j,i) and distance-based P\!\!\!(j,i) quality probabilities along with the adaptive probability Padp, utilizing the energy and distance optimality d\!opt factors. Furthermore, the algorithm utilizes the optimal clustering max derived in Adapt-P to perform adaptive clustering through max-means++. The proposed Pc max-means++ is compared with the energy-based algorithm Pη max-means++ and distance-based P dopt max-means++ algorithm, and has shown an optimized performance in term of residual energy and stability period of the network.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.