2011
DOI: 10.3724/sp.j.1146.2006.01792
|View full text |Cite
|
Sign up to set email alerts
|

A Multi-weight Based Clustering Algorithm for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 1 publication
0
8
0
Order By: Relevance
“…DWCA provides better performances than WCA in terms of the number of re-affiliations, end-to-end throughput, overheads during the initial clustering set up phase, and the minimum lifespan of nodes. Multi-weight based clustering (MWBC) [50] is a multiweight based clustering protocol for maximal-lifetime wireless sensor network design, in which a weighted sum method is adopted in the CH selection to achieve the tradeoff by considering several factors such as the ideal degree, the current energy, the transmission power, the link quality, and relatively position of nodes with respect to relevant weights.…”
Section: Trade-off In Cluster Head Electionmentioning
confidence: 99%
“…DWCA provides better performances than WCA in terms of the number of re-affiliations, end-to-end throughput, overheads during the initial clustering set up phase, and the minimum lifespan of nodes. Multi-weight based clustering (MWBC) [50] is a multiweight based clustering protocol for maximal-lifetime wireless sensor network design, in which a weighted sum method is adopted in the CH selection to achieve the tradeoff by considering several factors such as the ideal degree, the current energy, the transmission power, the link quality, and relatively position of nodes with respect to relevant weights.…”
Section: Trade-off In Cluster Head Electionmentioning
confidence: 99%
“…MWBC [17] is a multi-weight based clustering algorithm for maximal-lifetime wireless sensor network design, which takes into consideration many factors such as the ideal degree, current energy, transmission power, link quality, and relatively position of nodes. First of all, nodes obtain the parameters that can describe the situation of the local network through exchanging information each other.…”
Section: Related Workmentioning
confidence: 99%
“…Energy and local distance are used in cluster head election mechanism using fuzzy logic (CHEF) [ 42 ] to compute the probability of being selected as CHs. The clustering algorithms proposed in [ 43 , 44 ] are similar to CHEF. The distance of the cluster centroid, the residual energy of nodes and network flow are selected to compute the selection probability of the CH.…”
Section: Related Workmentioning
confidence: 99%