The increasing interest in cognitive radio ad hoc network (CRAHN) has driven study and development for latest approaches. The minimum spanning trees are advantageous for data broadcasting and disseminating. This article presents an associate in nursing algorithm rule for the construction of minimum spanning tree (MST) in cognitive radio network (CRN). For communication network, MST square measure is used for important network tasks like broadcast, leader election, and synchronization. We tend to be commenced our message and time restriction-based cost or weight estimation efficient distributed algorithm for construction of a minimum spanning tree. Proposed algorithm describes including facilitates of state diagram illustration. The verification demonstration of the proposed algorithm is additionally enclosed.
CITATION STYLE
Rohilla, D., Murmu, M. K., & Kulkarni, S. (2020). An efficient distributed approach to construct a minimum spanning tree in cognitive radio network. In Advances in Intelligent Systems and Computing (Vol. 1045, pp. 397–407). Springer. https://doi.org/10.1007/978-981-15-0029-9_31
Mendeley helps you to discover research relevant for your work.