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

Algorithm 1

() Every node exchanges its unique ID and Residual Energy RE value (in case of reconstruction) with in

   its transmission range. Obtains 1-hop neighbor list, .

() Every node again exchanges the list to obtain the 2-hop neighbor list which also includes the RE energy values

() A node with highest number of neighbors and lowest ID is elected as dominator initially.

() Now the dominator changes its color to BLACK and all its neighbors turn to GREY and broadcast this information

() IF an uncovered WHITE node receives this information from a GREY neighbor

() THEN it converts itself to GREY and its GREY neighbor to BLACK

() This procedure is repeated until no WHITE node exist