New Computation of Resolving Connected Dominating Sets in Weighted Networks

Abstract

In this paper we focus on the issue related to finding the resolving connected dominating sets (RCDSs) of a graph, denoted by G. The connected dominating set (CDS) is a connected subset of vertices of G selected to guarantee that all vertices in the graph are connected to vertices in the CDS. The connected dominating set with minimum cardinality, or minimum CDS (MCDS), is an adequate virtual backbone for information interchange in a network. When distinct vertices of G have also distinct representations with respect to a subset of vertices in the MCDS, it is said that the MCDS includes a resolving set (RS) of G. With this work, we explore different strategies to find the RCDS with minimum cardinality in complex networks where the vertices have different importances.

Using Minimum Connected Dominating Set for Mobile sink path planning in Wireless Sensor Networks

“…A CDS can be defined as a subset of nodes of an undirected graph forming a connected subgraph that is derived from the original one where each of the original graph's nodes is either a member of the derived CDS or a neighbour to a CDS member. Furthermore, constructing a CDS with minimum cardinality results in forming an MCDS, which can be used to exchange information in any type of network because an MCDS act as a virtual backbone [11], [12].…”