2015
DOI: 10.1007/978-3-319-19578-0_35
|View full text |Cite
|
Sign up to set email alerts
|

Balanced and Safe Weighted Clustering Algorithm for Mobile Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…The residual energy and throughput of the individual sensor nodes were determined to be higher through an average margin of 21% and 16% compared to the existing cluster approaches. Then, a Balanced and Safe Weighted Algorithm‐based Cluster Head Selection Mechanism (BSWCA‐CHSM) was proposed for improving the limitations of the previous energy efficiency and safe weighted method through the combination of five factors that include mobility, degree of connectivity, sensor node and its collaborating neighbors distance, residual energy, and behavioral metrics 16 . This BSWCA‐CHSM method inherits a principle of heuristics for assigning the weights to the cooperating sensor nodes based on the potential of the nodes acting as the cluster heads.…”
Section: Related Workmentioning
confidence: 99%
“…The residual energy and throughput of the individual sensor nodes were determined to be higher through an average margin of 21% and 16% compared to the existing cluster approaches. Then, a Balanced and Safe Weighted Algorithm‐based Cluster Head Selection Mechanism (BSWCA‐CHSM) was proposed for improving the limitations of the previous energy efficiency and safe weighted method through the combination of five factors that include mobility, degree of connectivity, sensor node and its collaborating neighbors distance, residual energy, and behavioral metrics 16 . This BSWCA‐CHSM method inherits a principle of heuristics for assigning the weights to the cooperating sensor nodes based on the potential of the nodes acting as the cluster heads.…”
Section: Related Workmentioning
confidence: 99%
“…For comparison purpose in Fig. 6, the performance of WOATCA has been compared with existing schemes such as Topology Control Algorithm for node mobility (TCM) [28], TCM [29], and secure CH selection [30] in terms of the number of dead nodes per round.…”
Section: Evaluation Of Proposed Schemementioning
confidence: 99%
“…7 shows the statistics of the number of alive or surviving nodes per round for the proposed approach. For WOATCA, the number of nodes alive per round is comparatively more than Adoptive LEACH Mobile (ALM) [28], TCM [29], and secure CH selection [30] as shown in Fig. 7.…”
Section: Evaluation Of Proposed Schemementioning
confidence: 99%
“…Dahane et al [17] presented an algorithm shortly called TCM, which is completely decentralized and goes for making a virtual topology with the reason to minimize regular reelection of the CH and evade by and large rebuilding of the whole network. This scheme chooses the most powerful and safe CHs with the obligation of checking the node in their cluster and maintaining clusters locally.…”
Section: Literature Reviewmentioning
confidence: 99%