A Distributed Approach to Construct Minimum Spanning Tree in Cognitive Radio Networks

The minimum spanning tree is useful for data disseminating or broadcasting where a leader node can regulate the data with minimum cost and time. The article presents an algorithm to construct minimum spanning tree in cognitive radio networks. The cognitive radio network works differently with single channel or multi-channel wireless networks than conventional wireless networks. The cognitive radio (or secondary user) nodes have multi-channel accessing capabilities during run time by adjusting the radio parameters according to the available spectrum. The primary user or licensed user holds the spectrum and if it is free, the secondary user can use this for any purpose. Initially, we identify the challenges related to formation of logical structure in cognitive radio network. Then, we present our time and message constrained based cost (or weight) estimation distributed algorithm to construct minimum spanning tree. We describe our algorithm with the help of state diagram representation. The correctness proof of the algorithm is also included.