2012
DOI: 10.1016/j.proeng.2012.06.137
|View full text |Cite
|
Sign up to set email alerts
|

Weight Based Hierarchical Clustering Algorithm for Mobile Ad hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3
2
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…On the contrary, it requires throughput and DL for further improvement. Sahana et al [15] proposed a weight-based hierarchical clustering based on the combined weight that comprises node's degree, communication area and node's mobility. Although CH is the highest weighted node, the network performance lacks efficiency.…”
Section: Literature Surveymentioning
confidence: 99%
“…On the contrary, it requires throughput and DL for further improvement. Sahana et al [15] proposed a weight-based hierarchical clustering based on the combined weight that comprises node's degree, communication area and node's mobility. Although CH is the highest weighted node, the network performance lacks efficiency.…”
Section: Literature Surveymentioning
confidence: 99%
“…On the contrary, throughput and DL were required for further improvement. Sahana et al [15] proposed a weight-based hierarchical clustering on the basis of the combined weight that comprises node's degree, communication area and node's mobility. Though the highest weighted node was selected as CH, the network performance was not efficiently analyzed.…”
Section: Literature Surveymentioning
confidence: 99%
“…= Optimal number of primary node, Ns = Number of nodes distributed randomly in a AxA region _fsd2 = amplifier energy (10* 0.00000000001) _mpd4 = amplifier energy (multi-path) (0.0013*0.00000000001) d = distance between transmitting node and base station d to BS = average distance between nodes and base station (50m) The value for both amplifier energy are taken from [17][18][19]. For MAP algorithm, the total number of sensor nodes at tier one are 25 nodes and for tier two are 75 nodes.…”
Section: Primary Node Selectionmentioning
confidence: 99%