2021
DOI: 10.17485/ijst/v14i3.2318
|View full text |Cite
|
Sign up to set email alerts
|

An efficient hybrid model for cluster head selection to optimize wireless sensor network using simulated annealing algorithm

Abstract: Objective: Energy efficiency aspect in wireless sensor networks (WSN) can be achieved by small sized rechargeable and easily replaceable batteries. The lifetime of wireless sensor network can be improved by identifying the efficient and reliable nodes as a cluster heads using Hybrid Simulated Annealing algorithm. The proposed algorithm identifies cluster head to reduce overhead and is capable of handling high volume of nodes with minimum node death rate. Methods: This study proposed initialization of populatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 20 publications
(15 citation statements)
references
References 48 publications
0
15
0
Order By: Relevance
“…e simulated annealing algorithm starts from a certain higher temperature, and after a large number of solution transformations, it can obtain the relatively optimal solution of the combinatorial optimization problem with a given control parameter value, then reduce the value of the control parameter, and repeatedly execute the Metropolis algorithm. When the control parameter t tends to 0, the overall optimal solution of the combinatorial optimization problem can be finally obtained [8].…”
Section: Simulated Annealing Algorithmmentioning
confidence: 99%
“…e simulated annealing algorithm starts from a certain higher temperature, and after a large number of solution transformations, it can obtain the relatively optimal solution of the combinatorial optimization problem with a given control parameter value, then reduce the value of the control parameter, and repeatedly execute the Metropolis algorithm. When the control parameter t tends to 0, the overall optimal solution of the combinatorial optimization problem can be finally obtained [8].…”
Section: Simulated Annealing Algorithmmentioning
confidence: 99%
“…At present, the multilayer feedforward network is based on back propagation (BP), but most of the learning algorithms of this network must be based on some nonlinear optimization technology. erefore, its application is limited due to the large amount of computation and slow learning speed [11][12][13].…”
Section: Introductionmentioning
confidence: 99%
“…In which A (ω), B(ω) , H f (ω) represents the frequency domain equivalent of the restored image, captured blurred image and the blur function (PSF) respectively (28)(29)(30)(31)(32) . As the L2 regularization will not conduct any denoising, in order to eliminate noise more frequencies in a blurred picture can be penalized by using Sobolev prior.…”
Section: Tikhonov and Sobolev Priorsmentioning
confidence: 99%