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

Algorithm 5

() IF a BLACK node (Dominator) moves away

() THEN

()   Immediate GREY node with highest and RE value is turned BLACK

    and execute algorithm phase 4 (activity scheduling)

() IF a GREY node (Dominatee) moves away

() THEN

()   No change

() IF a BLACK node’s RE ≤ TH

() THEN

()   Turn BLACK node to RED and handover the Dominator status to equivalent counterpart

      and execute algorithm phase 4 (activity scheduling)

() IF a new WHITE node joins the network

() THEN

()   IF it has BLACK node (dominator) in its range then

()    Convert itself to GREY (dominate)

()   ELSE

()    Convert itself to GREY and its GREY neighbor to BLACK (as connector)

          and execute algorithm phase 4 (activity scheduling)