A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks

Abstract

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.

A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks

“…The TLCDSC Algorithm builds in more crowded clusters than CDSC Algorithm [1], in this terms the algorithm satisfies the main objective. We can say that the algorithm can be preferable in environments in which the density value does not exceed the maximum degree of 6 as shown in the graphs.…”

“…It finds a connected dominating set which can be used as a backbone, it is totally distributed and it does not require a predefined routing mechanism. In the CDSC Algorithm [1], we added some extra heuristics to Wu and Li's algorithm [14] and provided more efficient results. We also added two more cluster head pruning rules.…”

“…We developed our algorithm as an extension of our previous algorithm [1]. First, we find a CDS on MANET using our CDS algorithm and call the resulting subset of cluster heads as First Level CDS, then we run the same clustering algorithm on the subset of First Level CDS.…”

“…Nanuvala [26] has extended the Wu's CDS Algorithm and added a third pruning rule. Cokuslu, Erciyes and Dagdeviren [1] added some extra heuristics to Wu and Li's algorithm [14] and provided more reliable results. They also added two more pruning rules.…”

“…Our algorithm is an extension of our previous Connected Dominating Set Based Clustering (CDSC) Algorithm [1]. We extended the levels of the CDS to two levels and improved functionality at each level by providing additional rules to make sure that every node belongs to a single cluster.…”