2010 5th International Symposium on Telecommunications 2010
DOI: 10.1109/istel.2010.5734059
|View full text |Cite
|
Sign up to set email alerts
|

An energy efficient algorithm for cluster-head selection in WSNs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…Hearing these advertisement messages, each sensor node chooses the nearest cluster head and registers itself as a cluster member leading to the formation of clusters. [1] Simulation results verify that the DDCHS algorithm extend the lifetime of network 50% more than the LEACH algorithm.…”
Section: A Density and Distance Based Cluster Head Selection Algorithmentioning
confidence: 71%
See 2 more Smart Citations
“…Hearing these advertisement messages, each sensor node chooses the nearest cluster head and registers itself as a cluster member leading to the formation of clusters. [1] Simulation results verify that the DDCHS algorithm extend the lifetime of network 50% more than the LEACH algorithm.…”
Section: A Density and Distance Based Cluster Head Selection Algorithmentioning
confidence: 71%
“…Wireless Sensor Networks (WSNs), have a wide range of applications in a variety of fields including physiological monitoring, environmental applications, military applications and home Security [1]. Because of the fact that each node has only limited energy resource and the battery power and it is practically not possible to replace battery every now and then.…”
Section: Objectivementioning
confidence: 99%
See 1 more Smart Citation