2009 16th International Conference on Systems, Signals and Image Processing 2009
DOI: 10.1109/iwssip.2009.5367771
|View full text |Cite
|
Sign up to set email alerts
|

Empirical Study of Clustering Algorithms for Wireless Ad Hoc Networks

Abstract: Abstract-In this study we evaluate with experiments three generic clustering algorithms, namely the Lowest-ID, the Highest Degree and the Extended Robust Re-clustering Algorithm which is the one proposed. The aim is to investigate which are the factors that have significant effect on the re-clustering performance. We isolate those performance factors as being network conditions that we simulate with a particular focus on the node deployment pattern, the mobility pattern, the radio transmission range and the en… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…The highest node degree clustering algorithm [18] is based on the degree of connectivity needed for clustering, and selects the node with the appropriate number of neighboring nodes as cluster head by calculating the numbers of neighbors of nodes. Shi and Luo [19] proposed a mechanism of cluster based location aided dynamic source routing, where CH is elected based on the energy level, relative velocity and degree of connectivity.…”
Section: Related Workmentioning
confidence: 99%
“…The highest node degree clustering algorithm [18] is based on the degree of connectivity needed for clustering, and selects the node with the appropriate number of neighboring nodes as cluster head by calculating the numbers of neighbors of nodes. Shi and Luo [19] proposed a mechanism of cluster based location aided dynamic source routing, where CH is elected based on the energy level, relative velocity and degree of connectivity.…”
Section: Related Workmentioning
confidence: 99%
“…single-factor clustering algorithms represented by the minimum ID clustering algorithm [12] , the minimum mobility clustering algorithm [13] and the highest node degree method [14] are difficult to meet the clustering requirements of the swarm UAV network. Scholars have paid more attention to the research of on-demand clustering and weighted clustering algorithms.…”
mentioning
confidence: 99%