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

Algorithm 3

) Every BLACK node exchanges its list in its transmission range

() All its neighbors exchange their list, where

() Every BLACK node performs intersection of list with its own . That is, ()

() Nodes with at most similar , that is, () and (RE > TH) are selected and turned BLACK

() Perform Activity scheduling (phase 4) between neighboring BLACK nodes at regular time interval

() Black nodes also calculate RE at regular intervals.

() IF (RE ≤ TH)

() THEN

() Repeat steps (), (), (), () & ()

() ELSE

() Continue