Abstract
We propose a new Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is based on Wu and Li's [14] algorithm, however we provide significant modifications by considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and measure performance of this new algorithm by simulation and show that it performs better than Wu and Li's [14] algorithm especially in the case of dense networks. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Cokuslu, D., Erciyes, K., & Dagdeviren, O. (2006). A dominating set based clustering algorithm for mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3991 LNCS-I, pp. 571–578). Springer Verlag. https://doi.org/10.1007/11758501_77
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
