A Distributed Minimum Spanning Tree Based on all Best Swap Edges in CRN

The minimum spanning tree is a fundamental problem in distributed networks. We wish to extend this problem into cognitive radio networks. In general, a tree spanner is minimum spanning tree T which has a real-weight with n vertex (or secondary user (SU)) and m edges. It approximately preserves distances to multiple stretch factor 6 in graph G. A tree spanner with good stretch factor may be useful to find the applications in distributed system, communication network, and network design. However, to find valuable tree spanner in CRN is very tough computational task. If we face an edge failure due to randomly appearance of primary user (PU) in cognitive radio network (may be minimum spanning tree), the effort must be afforded to reconstruct a new minimum spanning tree can be excessive. To avoid this drawback, we propose an efficient algorithm in CRN. The method aims to lists all finest feasible edge and applies swapping of edges in order to find MST in CRN. Moreover, the article acquainted and resolved issues related to all finest swap edges of MST in a cognitive radio network.