
44
Wireless Ad Hoc and Sensor Networks
Distributed algorithms using single leader;
Distributed algorithms using multiple leaders.
We use n to denote the number of sensors in a WSN, Δ to denote the maximum
degree of nodes in the graph representing a WSN, and opt to denote the size of any
optimal MCDS.
3.2.1 Centralized Algorithms for CDSs
Guha et al. [20] first proposed two centralized greedy algorithms with performance
ratios of 2(H(Δ)+1) and H(Δ)+2 respectively, where H is a harmonic function.
The greedy function is based on the number of white neighbors of each node. At
each step, the one with the largest such number becomes a dominator.
Due to the ...