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

被引:4
作者
Murmu, Mahendra Kumar [1 ]
机构
[1] Natl Inst Technol, Dept Comp Engn, Kurukshetra 136119, Haryana, India
来源
PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON ECO-FRIENDLY COMPUTING AND COMMUNICATION SYSTEMS | 2015年 / 70卷
关键词
Cognitive radio network; Minimum spanning tree; Minimum cost; Distributed algorithm; WIRELESS NETWORKS; ALGORITHM;
D O I
10.1016/j.procs.2015.10.066
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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. (C) 2015 The Authors. Published by Elsevier B.V.
引用
收藏
页码:166 / 173
页数:8
相关论文
共 17 条
  • [1] NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey
    Akyildiz, Ian F.
    Lee, Won-Yeol
    Vuran, Mehmet C.
    Mohanty, Shantidev
    [J]. COMPUTER NETWORKS, 2006, 50 (13) : 2127 - 2159
  • [2] Akyildiz IF, 2009, AD HOC NETW, V7, P811
  • [3] Almasaeid H M, IEEE GLOB 2010 P
  • [4] Awerbuch B., 1987, ACM S THEOR COMP
  • [5] Energy-Optimal Distributed Algorithms for Minimum Spanning Trees
    Choi, Yongwook
    Khan, Maleq
    Kumar, V. S. Anil
    Pandurangan, Gopal
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (07) : 1297 - 1304
  • [6] A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES
    GALLAGER, RG
    HUMBLET, PA
    SPIRA, PM
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01): : 66 - 77
  • [7] Coordination problem in cognitive wireless mesh networks
    Gardellin, Vanessa
    Das, Sajal K.
    Lenzini, Luciano
    [J]. PERVASIVE AND MOBILE COMPUTING, 2013, 9 (01) : 18 - 34
  • [8] Hua Q S, 2012, INT S PERV SYST ALG
  • [9] Neighbor discovery in traditional wireless networks and cognitive radio networks: Basics, taxonomy, challenges and future research directions
    Khan, Athar Ali
    Rehmani, Mubashir Husain
    Saleem, Yasir
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2015, 52 : 173 - 190
  • [10] A fast distributed approximation algorithm for minimum spanning trees
    Khan, Maleq
    Pandurangan, Gopal
    [J]. DISTRIBUTED COMPUTING, 2008, 20 (06) : 391 - 402