A Distributed Minimum Spanning Tree for Cognitive Radio Networks

The minimum spanning tree is a classical problem in distributed system environment. We extend this challenge in Cognitive Radio Networks (CRN). In CRN, the spectrum mobility and the node mobility creates connectivity problem during neighbour discovery. Thus, finding edges (or relation graph) between the SU nodes in order to create communication graph for Minimum Spanning Tree (MST) is a challenge in cognitive radio network. In the present work, we propose a solution to the problem of creating minimum spanning tree ( MST) in cognitive radio network. It is a message passing based distributed algorithm. The MST algorithm find shortest path between any pairs of SUs (or vertices) in the communication graph of CRN. The communication message complexity of our algorithm is 6E, where E represents the edges. The MST is useful for data dissemination in cognitive radio network. (C) 2016 The Authors. Published by Elsevier B.V.