A Connected Dominating Set (CDS) of a graph representing a Wireless Sensor Network can be used as a virtual backbone for routing through the network. Since the sensors in the network are constrained by limited battery life, we desire a minimal CDS for the network, a known NP-hard problem. In this paper we present three randomized algorithms for constructing a CDS. We evaluate our algorithms using simulations and compare them to the two-hop K2 algorithm and two other greedy algorithms from the literature. After pruning, the randomized algorithms construct a CDS that are generally equivalent in size to those constructed by K2 while being asymptotically better in time and message complexity. This shows the potential of significant energy savings in using a randomized approach as a result of the reduced complexity.
A. Dhawan, M. Tanco and A. Yeiser, "Randomized algorithms for approximating a Connected Dominating Set in Wireless Sensor Networks," 2015 International Conference on Computing and Network Communications (CoCoNet), Trivandrum, 2015, pp. 589-596.