On Calculating Stable Connected Dominating Sets Based on Link-Stability for Mobile Ad Hoc Networks

Abstract

In a mobile ad hoc network (MANET), routing based on a connected dominating set (CDS) has been recognized as a promising approach to adapt quickly to fast changing topologies. Due to the dynamic nature and the limited battery power of the mobile nodes, their association and dissociation to and from CDS perturb the stability of the network and thus reconfiguration of CDS is unavoidable. Re-computation of CDS and frequent information exchange among the participating nodes will result in high computation cost overhead. Therefore, it is obvious that a more stable CDS will directly lead to the performance improvement of the whole network. In this paper, we will propose an efficient distributed algorithm that can establish a stable CDS by keeping a node with many weak links from being elected as the members of the CDS. Computer simulations show that the CDSs generated by our distributed algorithm are more stable than those generated by other existing algorithms.