ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2311.10595
32
0

PcεκmaxP_c\varepsilonκ_{max}Pc​εκmax​-Means++: Adapt-PPP Driven by Energy and Distance Quality Probabilities Based on κκκ-Means++ for the Stable Election Protocol (SEP)

17 November 2023
Husam Suleiman
ArXivPDFHTML
Abstract

The adaptive probability PadpP_{\text{\tiny{adp}}}Padp​ formalized in Adapt-PPP is developed based on the remaining number of SNs ζ\zetaζ and optimal clustering κmax\kappa_{\text{\tiny{max}}}κmax​, yet PadpP_{\text{\tiny{adp}}}Padp​ does not implement the probabilistic ratios of energy and distance factors in the network. Furthermore, Adapt-PPP 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{kkk\small{-}means\small{++}} and Adapt-PPP to propose \nolinebreak{PcκmaxP_{\text{c}} \kappa_{\text{\tiny{max}}}Pc​κmax​\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 PcP_\text{c}Pc​ developed based on energy-based Pη(j,i)P_{\eta(j,i)}Pη(j,i)​ and distance-based P ⁣ ⁣ ⁣ψ(j,i)P\!\!\!_{\psi(j,i)}Pψ(j,i)​ quality probabilities along with the adaptive probability PadpP_{\text{\tiny{adp}}}Padp​, utilizing the energy ε\varepsilonε and distance optimality d ⁣optd\!_{\text{\tiny{opt}}}dopt​ factors. Furthermore, the algorithm utilizes the optimal clustering κmax\kappa_{\text{\tiny{max}}}κmax​ derived in Adapt-PPP to perform adaptive clustering through \nolinebreak{κmax\kappa_{\text{\tiny{max}}}κmax​\small{-}means\small{++}}. The proposed \nolinebreak{PcκmaxP_{\text{c}} \kappa_{\text{\tiny{max}}}Pc​κmax​{\small{-}}means{\small{++}}} is compared with the energy-based algorithm \nolinebreak{PηεκmaxP_\eta \varepsilon \kappa_{\text{\tiny{max}}}Pη​εκmax​{\small{-}}means{\small{++}}} and distance-based \nolinebreak{PψdoptκmaxP_\psi d_{\text{\tiny{opt}}} \kappa_{\text{\tiny{max}}}Pψ​dopt​κmax​{\small{-}}means{\small{++}}} algorithm, and has shown an optimized performance in term of residual energy and stability period of the network.

View on arXiv
Comments on this paper