
96
Wireless Ad Hoc and Sensor Networks
5.2.1.1 Centralized Algorithms for CDSs
Guha et al. [20] first gave 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(s) with the largest such number become dominator(s).
He et al. [80][81][28][68] considered load-balance factor when constructing a
CDS. The authors proposed a greedy algorithm to construct a load-balanced CDS
(LBCDS) and then load-balancedly allocate dominatees to dominators (LBAD) in
[80][81]. Subsequently, in [28][68], the ...