Abstract
Assign frequency channel to each node channel assignment technique is used in the common networks. In cognitive radio networks (CRNs), dynamic spectrum access is used in multi-channel networks. The CRNs are more efficient than traditional networks in terms of bandwidth utilization. The CRN is symbolized by selecting a channel for each unlicensed user from the set of available channels at every point in the path. Routing is possible if at least one mutual channel exists between any node pairs in the path. In traditional multi-hop networks, a theoretical graph has been used. Yet, it is not easy to simulate a multi-hop cognitive radio network efficiently or maintain the information needed in order to achieve optimal routing. Due to this, a multi-edge planer graph has been designed to implementing AODV, DSDV routing protocol. In this article, we proposed an algorithm to create a minimum spanning tree (MST) in a multi-hop CRN. The MST employs a routing protocol that is helpful to eliminate redundant links and counter loops in the network. Using this method, we intend to keep stable the performance of the networks even if some nodes increase.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Murmu, M.K.: A distributed approach to construct minimum spanning tree in cognitive radio networks. ICECCS Procedia Comput. Sci. 70, 166–173 (2015)
Sun, X., Chang, C., Su, H., Rong, C.: Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm. In: Mathematical Problems in Engineering, article ID 601782, pp. 1–7. Hindwai Publishing (2015)
Singh, A.K., Negi, A., Kumar, M., Rathee, V., Sharma, B.: On the linear time construction of minimum spanning tree. In: ACEEE Proceedings of International Conference on Recents Trends in Information, Telecommunication and Computing, pp. 82–87 (2014)
Kondareddy, Y.R., Agrawal, P.: A graph-based routing algorithm for multi-hop cognitive radio networks. In: Proceedings of the 4th International ICST Conference on Wireless Internet (2008)
Mazeev, A., Semenov, A., Simonov, A.: A distributed parallel algorithm for the minimum spanning tree problem. In: Parallel Computational Technologies, Springer CCIS Series, vol. 753, pp. 101–113 (2017)
Sichitiu, M.L.: Wireless mesh networks: opportunities and challenges. In: Proceedings of World Wireless Congress, vol. 2 (2005)
Akyildiz, I.F., Wang, X., Wang, W.: Wireless mesh networks: a survey. Comput. Netw. 47(4), 445–487 (2005)
Zhao, Q., Swami, A.: A survey of dynamic spectrum access: signal processing and networking perspectives. In: 2007 IEEE International Conference on Acoustics, Speech, and Signal Processing—ICASSP 07 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Rohilla, D., Murmu, M.K. (2020). A Distributed Algorithm to Create a Minimum Spanning Tree in a Multi-channel Cognitive Radio Network. In: Bansal, J., Gupta, M., Sharma, H., Agarwal, B. (eds) Communication and Intelligent Systems. ICCIS 2019. Lecture Notes in Networks and Systems, vol 120. Springer, Singapore. https://doi.org/10.1007/978-981-15-3325-9_4
Download citation
DOI: https://doi.org/10.1007/978-981-15-3325-9_4
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3324-2
Online ISBN: 978-981-15-3325-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)