inis 19(21): e4

Research Article

A Simulation Analysis of the Connectivity of Multi-hop Path between Two Arbitrary Nodes in Cognitive Radio Ad Hoc Networks

Download40 downloads
  • @ARTICLE{10.4108/eai.24-10-2019.160984,
        author={Le  The  Dung and Ba  Cao  Nguyen and Tran  Manh  Hoang},
        title={A Simulation Analysis of the Connectivity of Multi-hop Path between Two Arbitrary Nodes in Cognitive Radio Ad Hoc Networks},
        journal={EAI Endorsed Transactions on Industrial Networks and Intelligent Systems},
        volume={6},
        number={21},
        publisher={EAI},
        journal_a={INIS},
        year={2019},
        month={10},
        keywords={wireless ad-hoc networks, cognitive radio networks, multi-hop path, connectivity, statistical simulation method},
        doi={10.4108/eai.24-10-2019.160984}
    }
    
  • Le The Dung
    Ba Cao Nguyen
    Tran Manh Hoang
    Year: 2019
    A Simulation Analysis of the Connectivity of Multi-hop Path between Two Arbitrary Nodes in Cognitive Radio Ad Hoc Networks
    INIS
    EAI
    DOI: 10.4108/eai.24-10-2019.160984
Le The Dung1,*, Ba Cao Nguyen2, Tran Manh Hoang2
  • 1: Department of Radio and Communication Engineering, Chungbuk National University, Republic of Korea
  • 2: Faculty of Radio Electronics, Le Quy Don Technical University, Viet Nam
*Contact email: dung.t.le@ieee.org

Abstract

The connectivity of multi-hop path is one of the key factors that influence the performance of multi-hop wireless networks. In this paper, assuming that secondary users (SUs) and primary users (PUs), using same licensed frequency bands, are uniformly distributed in square network area, we investigate the connectivity of multi-hop path in cognitive radio ad-hoc networks (CRAHNs). Specifically, we propose an algorithm to find all available multi-hop paths between arbitrary source node and destination node in CRAHNs with random node distribution and PU activity. Then, we use statistical simulation method to intensively evaluate the connectivity of multi-hop path compared with that in conventional ad-hoc networks (AHNs) by using huge number of random network topologies with different network parameters such as the number of SUs and PUs, network size, network operating frequency, and the average active rates of PU. The simulation results reveal many interesting and distinguishing features of the connectivity of multi-hop path in CRAHNs. Moreover, from the simulation graphs in this paper, network designers can select optimal network parameters so that the reliability of network topology is high while saving network resources. Finally, the simulation results can be used to verify mathematical models of the connectivity of multi-hop path in CRAHNs in future research.