The simulation of an improved blocking algorithm for next generation network

This paper mainly focuses on the construction algorithm for ad hoc virtual backbone. The virtual backbone is approximated by minimum connected dominating set in unit-disk graphs. The approximation algorithms to compute network blocking are called CDS algorithms. There are various distributed CDS algorithms. We propose improved measures based on a cost-aware algorithm. The improved algorithm optimizes the generated CDS and is simulated in VxWorks. Also we calculate the blocking probabilities for the network model and the routing scheme is the least loaded routing. After this, we also consider the blocking probabilities in the circuit-switching networks.