
68
Wireless Ad Hoc and Sensor Networks
4.2.1 Subtraction-based Algorithms for CDS-based VBs
Wu and Li first proposed a distributed algorithm in [33] to obtain a CDS. The CDS
construction procedure consists of two stages. In the first stage, each node collects
its neighboring information by exchanging message with the one-hop neighbors. If
a node finds that there is a direct link between any pair of its one-hop neighbors,
it removes itself from the CDS. In the second stage, additional heuristic rules are
applied to further reduce the size of the CDS. Wu’s algorithm [33] uses Rule 1 and
Rule 2, where a node is removed from the CDS, if all its neighbors ...