2009 Second International Workshop on Computer Science and Engineering 2009
DOI: 10.1109/wcse.2009.705
|View full text |Cite
|
Sign up to set email alerts
|

A Wireless Sensor Network Clustering Algorithm Based on Energy and Distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(11 citation statements)
references
References 3 publications
0
11
0
Order By: Relevance
“…They discussed the factors that contribute to the partition of clusters, including residual energy and the distance to the cluster's centroid. Hou et al [10] proposed an improved LEACH Protocol in the aspect of selection of the CHs and energy consumption balance. Wu et al [11] introduced a dynamic sleep scheduling mode rather than the fixed sleep/wake-up mode in LEACH, which can improve the network lifetime remarkably.…”
Section: Related Workmentioning
confidence: 99%
“…They discussed the factors that contribute to the partition of clusters, including residual energy and the distance to the cluster's centroid. Hou et al [10] proposed an improved LEACH Protocol in the aspect of selection of the CHs and energy consumption balance. Wu et al [11] introduced a dynamic sleep scheduling mode rather than the fixed sleep/wake-up mode in LEACH, which can improve the network lifetime remarkably.…”
Section: Related Workmentioning
confidence: 99%
“…Rui et al [25] suggested Energy & Distance LEACH (EDL) in which remaining energy and distance of SNs are the key parameters. The chances of becoming CH are more for SN with more remaining energy and less distance in network.…”
Section: Two Levels Ch Selectionmentioning
confidence: 99%
“…Detailed study of above mentioned threshold can be found in [25]. For data transmission, single hop communication is used for intercluster or intracluster communication.…”
Section: Two Levels Ch Selectionmentioning
confidence: 99%
“…In addition, Hou, R. et al [8] proposed T-LEACH which considered the remnant power of sensor nodes in order to balance network loads and changes the round time by introducing a new probability (P head ), the optimum number of clusters over all nodes instead of that used in the traditional LEACH. This probability took the distance between CHs and BS into account including the area coverage (M is the length of node distributing field) and the number of existing nodes as follows:…”
Section: Related Work In Leach Cluster Head Selection Techniquesmentioning
confidence: 99%