depth latency...

Simulate algorithm with topology

• All the defined algorithms are applied to the topology that was created in the beginning.
• Every algorithm defines the spanning tree.
• This spanning tree is a degree-bounded directed spanning tree.

Analysis the Results

• The various issues like average latency, average hop counts, Maximum latency, depth, etc. are calculated for every algorithm.
• The DBSPT algorithm is also analysed.Various empirical calculations and worst-case approximation factors are analyzed.
• The results show that the DBSPT algorithm is the most efficient of all.