A Partial Reconstruction of Connected Dominating Sets in the Case of Fault Nodes

Node failure in a connected dominating set (CDS) is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. For a typical localized algorithm to construct CDS, it has the time complexity of O(Δ^II), where Δ is the maximum degree of an input graph. In this paper we inspect the problem of load balancing in a dominating-set based routing. The motivation of load balancing is to prolong the network lifetime, while minimize the partitions of the network due to node failure, where they cause interruptions in communication among nodes. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. The number of nodes which should be awaken during partial reconstruction is less than 2(Δ-1)×p, where ρ is the nodes from CDS and the neighbor of the faulty node.