Skip to main content

An Efficient Distributed Approach to Construct a Minimum Spanning Tree in Cognitive Radio Network

  • Conference paper
  • First Online:
  • 1464 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1045))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Murmu, M.K., Firoz, A.M., Meena, S., Jain, S.: A distributed minimum spanning tree for cognitive radio networks. IMCIP Proc. Comput. Sci. 89, 162–169 (2016). (Elsevier)

    Article  Google Scholar 

  2. Singh, G., Kumar, N., Verma, A.K.: Ant colony algorithms in MANETs: A review. J. Netw. Comput. Appl. 6, 1964–1972 (2012). (Elsevier)

    Article  Google Scholar 

  3. Sun, X., Chang, C., Su, H., Rong, C.: Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm. Math. Probl. Eng. Article ID 601782 (2015) (Hindwai Publishing)

    Google Scholar 

  4. Ibanez, M.L., Stutzle, T., Dorigo, M.: Ant colony optimization: A component-wise overview. IRIDIA Technical Report Series (2015)

    Google Scholar 

  5. Qiang, H.Z., Kai, N., Tao, Q., Tao, S., Jun, X.W., Li, G., Ru, L.J.: A bio-inspired approach for cognitive radio networks. Int. J. Chin. Sci. Bull. Theor. Wirel. Networks 57(28), 3723–3730 (2012). (Springer)

    Google Scholar 

  6. Song, Z., Shen, B., Zhou, Z.: Improved ant routing algorithm in cognitive radio networks. In: IEEE Conference (2009)

    Google Scholar 

  7. Alam, S.S., Marcenaro, L., Regazzoni, C.: Opportunistic spectrum sensing and transmissions. In: Cognitive Radio and Interference Management: Technology and Strategy: Technology and Strategy (Chap. 1) (2012)

    Google Scholar 

  8. Ducatelle, F., Caro, G.D., Gambardella, L.M.: Using ant agents to combine reactive and proactive strategies for routing in mobile ad hoc networks. J. Comp. Intel. Appl. 5(169), 1–15 (2005). (Researchgate)

    MATH  Google Scholar 

  9. Fernandez-Marquez, J.L., Serugendo, G.D.M., Montagna, S.: BIO-CORE: Bio-inspired self-organising mechanisms core. In: Bio-Inspired Models of Networks, Information, and Computing Systems on LNICST, vol. 103, pp. 59–72 (2012)

    Google Scholar 

  10. Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. IRIDIA Artif. Life 5(2), 137–172 (1999) (MIT Library)

    Google Scholar 

  11. Mao, X., Ji, H.: Biologically-inspire distributed spectrum access for cognitive radio network. In: IEEE Conference. Beijing University of Posts and Telecommunications (2010)

    Google Scholar 

  12. Qiang, H.Z., Kai, N., Tao, Q., Tao, S., Jun, X.W., Li, G., Ru, L.J.: A bio-inspired approach for cognitive radio networks. Int. J. Chin. Sci. Bull. Theor. Wireless Netw. 57(28)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mahendra Kumar Murmu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rohilla, D., Murmu, M.K., Kulkarni, S. (2020). An Efficient Distributed Approach to Construct a Minimum Spanning Tree in Cognitive Radio Network. In: Luhach, A., Kosa, J., Poonia, R., Gao, XZ., Singh, D. (eds) First International Conference on Sustainable Technologies for Computational Intelligence. Advances in Intelligent Systems and Computing, vol 1045. Springer, Singapore. https://doi.org/10.1007/978-981-15-0029-9_31

Download citation

Publish with us

Policies and ethics