Abstract
Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We first look at minimum spanning tree(MST) based algorithms and then propose a new algorithm for clustering in MANETs. The algorithm we propose merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Dagdeviren, O., Erciyes, K., & Cokuslu, D. (2005). Merging clustering algorithms in mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3816 LNCS, pp. 56–61). https://doi.org/10.1007/11604655_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
