Advanced Science and Technology Letters 2013
DOI: 10.14257/astl.2013.43.04
|View full text |Cite
|
Sign up to set email alerts
|

Energy Efficiency Cluster Head Selection for Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 5 publications
0
7
0
Order By: Relevance
“…According to the residual energy parameters of CHs and the number of members in the previous process, a reward-based clustering algorithm was proposed to periodically select CHs by learning methods [13]. Under the consideration of energy saving, a CH selection algorithm was proposed to select CHs by the density of member nodes and the distance from CHs, which is more energy efficient than only considering the distance between nodes [14]. Secondly, based on the CH selection process, a distributed channel selection algorithm was proposed, which balances the energy consumption between sensors based on the distance between sensors and base stations [15].…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…According to the residual energy parameters of CHs and the number of members in the previous process, a reward-based clustering algorithm was proposed to periodically select CHs by learning methods [13]. Under the consideration of energy saving, a CH selection algorithm was proposed to select CHs by the density of member nodes and the distance from CHs, which is more energy efficient than only considering the distance between nodes [14]. Secondly, based on the CH selection process, a distributed channel selection algorithm was proposed, which balances the energy consumption between sensors based on the distance between sensors and base stations [15].…”
Section: Literature Reviewmentioning
confidence: 99%
“…2: Initialize (λ, ν) 1 and r 1 , r 2 , r 3 = 0. Update M r 1 according to Equation (14) Update (λ, ν) r 1 +1 according to Equations ( 16) and (17), respectively.…”
Section: Algorithm 2 Data Collection and Topology Control Based On Aco (Dctc)mentioning
confidence: 99%
“…Another distributed clustering algorithm is density and distance based CH selection algorithm (DDCHS) [21]. In the clustering step, the area is virtually divided into hexagons so that circular cluster overlap is prevented and in fact, some borders are considered for clusters.…”
Section: Literature Reviewmentioning
confidence: 99%
“…MECH algorithm [18] is another algorithm in which the clustering is performed on the basis of nodes' radio range and the number of nodes in each cluster. Another widely used algorithm is DDCHS [19]. In this algorithm, some virtual areas have been considered for clusters and for each hexagon a CH is selected.…”
Section: Related Workmentioning
confidence: 99%