Algorithm for CDT |
(1) Construct PLDel, set color of each node to WHITE, |
and broadcast all its 1-hop neighbor information |
using the packet Neighbor_Packet. |
(2) Nodes having lowest id among its 2-hop neighbors set |
their color to BLACK. |
(3) Each BLACK node chooses a set of nodes from its |
1-hop neighbors using the following |
method, see Figure 4. |
(a) = empty |
(b) = farthest
neighbor |
(c) = |
(d) for |
|
= choose th farthest
neighbor |
if makes more than angle with |
|
then = |
|
(4) Each BLACK node adds the constraint edges to the |
nodes in and broadcasts these constraint edges |
information using the message Constraint_Packet. |
(5) Each WHITE node sets its color = BROWN if it is |
other end of any constrained edges received using |
Constraint_Packet. |
(6) Each BROWN node broadcasts its constraint edge information |
using the control packet Constraint_Packet. |
(7) All WHITE and BROWN nodes remove edges connec- |
ted to it which crosses constraint edges, see
Figure 5(b). |
This information is broadcasted using
Edgecross_Packet. |
(8) Each BLACK node places a new edge from the
WHITE |
nodes, from which the edge was deleted in
the previous |
step to form new triangles, see Figure 6. |