An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks

Algorithm 2

() Every GREY node checks its neighbor list for more than one BLACK node.

() IF (Number of BLACK nodes >1)

() THEN convert its color to BLACK (connector) and exchange this information

() ELSE

() Two nearest GREY nodes of different BLACK nodes turns themselves as

    BLACK to establish the connection (these are connectors)