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.
[1]
Arthur L. Liestman,et al.
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
,
2002,
MobiHoc '02.
[2]
Ivan Stojmenovic,et al.
On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks
,
2002,
J. Commun. Networks.
[3]
Yoo Sang-Jo,et al.
Power, mobility and wireless channel condition aware connected dominating set construction algorithm in the wireless ad-hoc networks
,
2005
.
[4]
Xiuzhen Cheng,et al.
Connected Dominating Set in Sensor Networks and MANETs
,
2004
.
[5]
A. Tomlinson.
POWER
,
1998,
The Palgrave Encyclopedia of Imperialism and Anti-Imperialism.
[6]
Samir Khuller,et al.
Approximation Algorithms for Connected Dominating Sets
,
1996,
Algorithmica.