Connectivity Analysis of Cognitive Radio Ad-Hoc Networks with Multi-Pair Primary Networks

Abstract

In this paper, we study the connectivity of cognitive radio ad-hoc networks (CRAHNs) where primary users (PUs) and secondary users (SUs) are randomly distributed in a given area following a homogeneous Poisson process. Moreover, for the sake of more realistic CRAHNs, contrary to previous works in the literature, we consider the case that primary network is comprised of multiple communication pairs which are spatial-temporal distributed in the network area. We also take into consideration the differences in transmission range and interference range of both PUs and SUs. The connectivity of such CRAHN is studied from three viewpoints. First, we mathematically analyze the probability of isolated secondary transmitter and secondary receiver. Second, we derive the approximation expression of the link probability between two adjacent SUs. Third, we investigate the path connectivity between two arbitrary SUs by using the simulation analysis approach. The correctness of our mathematical expressions is confirmed by comparing analytical results with simulation results. The results in this paper provide insights into how multiple communication pairs in primary network affect the connectivity of secondary network, which can be useful guidelines for the design of CRAHNs.

Connectivity analysis of directed highway vehicular ad hoc networks using graph theory

“…A measure of connectivity in VANETs is the connectivity probability, that is, the probability that the network forms a single connected component 10 . The two terms, connectivity and connectivity probability , have been used interchangeably in literature 31,32 . Knowing the traffic headway distribution for given traffic conditions allows estimating the connectivity probability as a function of the node density and the communication range.…”

“…Monte Carlo simulations are carried out by repeating and averaging‐out random topological realizations of the network under specific physical conditions (a fixed node degree, communication range, and certain spatial distribution of nodes). Each realization can be considered deterministic, and the average network behavior (mean connectivity probability in our case) is determined through finding the mean value of the connectivities of the different realizations 31,58,59 …”