In this paper, we analyze the connectivity of cognitive radio adhoc networks in a lognormal shadow fading environment. Considering secondary user and primary user’s locations and primary user’s active state are randomly distributed according to a homogeneous Poisson process and taking into account the spectrum sensing efficiency of secondary user, we derive mathematical models to investigate the connectivity of cognitive radio adhoc networks in three aspects and compare with the connectivity of adhoc networks. First, from the viewpoint of a secondary user, we study the communication probability of that secondary user. Second, we examine the possibility that two secondary users can establish a direct communication link between them. Finally, we extend to the case of finding the probability that two arbitrary secondary users can communicate via multihop path. We verify the correctness of our analytical approach by comparing with simulations. The numerical results show that in cognitive radio adhoc networks, high fading variance helps to remarkably improve connectivity behavior in the same condition of secondary user’s density and primary user’s average active rate. Furthermore, the impact of shadowing on wireless connection probability dominates that of primary user’s average active rate. Finally, the spectrum sensing efficiency of secondary user significantly impacts the connectivity features. The analysis in this paper provides an efficient way for system designers to characterize and optimize the connectivity of cognitive radio adhoc networks in practical wireless environment.
1. Introduction
N
owadays, technological advances together with the demands for efficient and flexible networks have led to the development of wireless adhoc networks where wireless devices can communicate with each other in a peertopeer fashion without relying on any fixed infrastructure. With the fast increase in the number of wireless devices, the industrial, scientific, and medical (ISM) bands are getting congested. Meanwhile, many other licensed spectrum bands are allocated through static polices. Studies sponsored by the Federal Communication Commission (FCC) observe that the average utilization of such bands varies between 15% and 18%
[1]
. To alleviate such inefficient spectrum resource utilization, a promising technology named cognitive radio is proposed. Cognitive radio technology enables unlicensed users to opportunistically utilize the licensed spectrum band in a dynamic and noninstructive manner so that they do not interfere with the operation of licensed users. In this framework, Cognitive Radio AdHoc Networks (CRAHNs)
[2]
are formed by cognitive radio nodes that communicate in distributed fashion by sharing licensed spectrum bands. In these networks, there are two kinds of users: Primary Users and Secondary Users. Primary Users (PUs) have the right to use licensed spectrum while Secondary Users (SUs) have to sense and detect available spectrum opportunities to be used for transmission. Every SU can opportunistically access a licensed spectrum band not used by a PU and it has to immediately vacate this spectrum band when the PU becomes active.
To model network level properties of CRAHNs, stochastic geometry
[3]
and percolation theory
[4]
are often used. In other words, percolation theory is targeted at random geographic graph where the nodes are random distributed and node’s transmission range is assumed to be a disk (i.e. a circle). This assumption is applied in designing routing protocols
[5

6]
as well as analyzing connectivity of CRAHNs.
So far, percolationbased connectivity has been investigated in distributed networks such as adhoc and wireless sensor networks
[7

8]
. Recently, the connectivity of CRAHNs has also been studied from the perspective of stochastic geometry and percolation theory. In
[9]
, the concept of
cognitive algebraic connectivity
, i.e., the second smallest eigenvalue of the Laplacian of a cognitive network graph is introduced. Then, this notion is used as metric for routing design in CRAHNs. The authors in
[10]
define
connectivity region
as the set of density pair – the density of SUs,
λ_{SU}
, and the density of PUs,
λ_{PT}
, under which the secondary network is connected. By using theories and techniques from continuum percolation, they derive the relation between the connectivity of a secondary network and the pair (
λ_{SU}
,
λ_{PT}
). In
[11]
, the authors introduce the
cognitive radio graph model
(CRGM) that takes into account the impact of the number of channels and the activities of PUs, and then combine the CRGM with continuum percolation model to study the connectivity of secondary network. On the basic of random geometric graph and probability theory, in
[12]
, a method that divides connectivity of CRAHNs into topological connectivity and physical connectivity is proposed to derive a closeform formula of connectivity between two SUs. In
[13]
, taking correct detection and false alarm probabilities (
P_{d}
and
P_{f}
), the authors derive a closeform model for the critical thinned density
λ_{S}
^{*}
of active SUs in a secondary network, that is, the density of SUs at which full connectivity of secondary network is ensured. Moreover, the percolation of the secondary network is investigated by using percolation confidence defined as the ratio of number SUs connected with the main component to the number of all active SUs in the secondary network.
Although a more accurate modeling of physical layer is indeed important in networklevel research on CRAHNs, all of aforementioned papers study the connectivityrelated properties by using a ideal disk link model to characterize the wireless channel, i.e. two nodes are connected if and only if the relative distance between them is less or equal to a certain threshold distance
r_{0}
, called transmission range as in
Fig. 1
(a). Such disk link model only reflects deterministic, distancedependent wireless channel. However, the wireless channel can be modeled in a more practical manner as in
Fig. 1
(b). Particularly, the randomness of channel condition induced by shadowing effects that are caused by obstacles in the networks should be taken into consideration.
Illustration of link models and resulting connectivity
In the literature, studies on the impact of different types of fading such as lognormal shadow fading, Rayleigh fading, and Nakagami
m
fading on the connectivity of adhoc networks are presented in
[14

16]
, respectively. Recently, investigation on the connectivity of CRAHNs with fading has attracted much research attention
[17
,
18]
. Particularly, the authors in
[17]
investigate the local connectivity, i.e. node degree and probability of node isolation of CRAHNs by using stochastic geometry
[3]
and probability theory. However, the influence of spectrum sensing efficiency of SU on local network connectivity is not considered and no results on link connectivity and multihop path connectivity are presented. In
[18]
, using percolation theory
[4]
, the authors derive the closedform expression of the outage probability of PU due to internetwork interference (SU to PU) with the sensing error of SU is taken into account and the upper and lower bounds of percolation area within which the secondary network percolates. Thus, this work aims at dense networks.
The aforementioned observations motivate us to derive mathematical models in a simple intuitive approach for analyzing the connectivity of CRAHNs with shadow fading. Taking into account the spatialtemporal spectrum availability and spectrum sensing efficiency of SU, our mathematical models can be used to analyze three important connectivityrelated features of secondary networks, e.g. communication probability of SU, probability of direct communication between two SUs, and the multihop connectivity of two arbitrary SUs in the network area. In addition, the models can be applied for both sparse and dense networks.
Fig. 2
illustrates the influence of shadow fading and PU existence on the connectivity of CRAHNs. Obviously, with shadow fading wireless channel, node’s transmission range is no longer a disk with radius
r_{0}
as in previous researches. Instead, it becomes a stochastic variable, resulting in more complexity of connectivity analysis.
The impact of shadow fading and PU existence on the connectivity of CRAHNs
The rest of this paper is organized as follows. In Section 2, we introduce formally the system model used in this paper. In Section 3, we study the connectivity of CRAHNs in three aspects, e.g. communication probability of a SU, probability of direct communication between two SUs, and multihop connectivity of two arbitrary SUs in the network area. Section 4 presents numerical results of the influence of shadow fading and PU’s existence on the connectivity in CRAHNs. Finally, Section 5 concludes this paper.
2. System model
 2.1 Spatial node distribution
The distribution of nodes in this paper is given by a random process on a finite network area
a
×
a
with
N
nodes in total. Specifically, it can be approximately characterized by the homogeneous Poisson process of density
ρ
=
N
/
a
^{2}
. This process has the following property:
 The number of nodes
M
in certain subarea
A
such as transmission area follows a Poisson distribution, i.e.,
where the expected value is
E
[
M
] =
λ
=
ρA
.
E
[
M
] can also be referred as the expected value of node degree
E
[
M
] , which will be discussed later.
 2.2 Primary network
The primary network consists of primary transmitters and primary receivers distributed in network area according to homogeneous Poisson point process of density
ρ_{P}
[19]
, denoted by
G
(
ρ_{P}
). The operation of primary transmitter on licensed spectrum band is associated with an independent and identical ONOFF state where the number of times that primary transmitter occupy licensed spectrum in a time unit follows Poisson distribution with average active rate
λ_{P}
. Thus, the probability that there are
x
spectrum occupation events of active primary transmitter in a time unit is
where
λ_{P}
is the average active rate of primary user.
Each primary transmitter is associated with a primary receiver. Thus, the number of times that primary receiver is in active state in a time unit also follows Poisson distribution with average active rate
λ_{P}
.
 2.3 Secondary network
The secondary network consists of
N_{s}
secondary users distributed in network area according to homogeneous Poisson point process of density
ρ_{S}
[19]
, denoted by
G
(
ρ_{S}
). Without the impact of primary network,
G
(
ρ_{S}
) models a standalone network as in AHNs. However, in temporalspatial spectrum agility of CRAHNs as considered in this paper, the establishment of wireless communication link between two SUs depends on both channel quality and transmission opportunity. This issue will be mathematically studied in detail in Section 3.
 2.4 Wireless channel model
To describe the wireless channel model used in this paper, we consider two nodes
i
and
j
locating at a relative distance
l
(
i
,
j
). Node
i
transmits signal with power
p_{t}
(
i
) and node
j
receives that signal with power
p_{r}
(
j
). Thus, the signal attenuation between these two nodes is defined as
and can be expressed in terms of dB as
In the shadow fading environment,
γ
(
i
,
j
) consists of two components: a deterministic component
γ
_{1}
(
i
,
j
) and a stochastic component
γ
_{2}
(
i
,
j
). The deterministic component is given by
where
α
is the path loss exponent. The stochastic component
γ
_{2}
(
i
,
j
) is assumed to follow lognormal probability density function. Therefore,
γ
_{2}
(
i
,
j
) in dB follows normal probability density function
[20
,
21]
, i.e.,
Typically, the value of standard deviation
σ
ranges up to 10 dB. The total attenuation in dB is the summation of two above components, specifically
From the perspective of signal transmission, node
j
receives the signal from
i
properly if
p_{r}
(
j
) is larger than or equal to a certain threshold power
p_{r,th}
(
j
), which can be referred as receiver sensitivity. If
p_{r}
(
j
) ≥
p_{r,th}
(
j
), it is said that node
i
can establish a wireless link to node
j
. We assume that channels are symmetric and all nodes, i.e. SUs and PUs, have the same
p_{t}
and
p_{r,th}
. Those assumptions will be used to analyze the connectivity of CRAHNs in the following section.
3. Connectivity analysis of CRAHNs
In this section, we analyze the connectivity of CRAHNs from the viewpoint of SU. First, we study the link connectivity and average number of neighbors of a SU in standalone secondary network without the impact of primary network. Then, we extend to the case where secondary network coexists with primary network, which is considered as the connectivity of CRAHNs with shadow fading.
 3.1 Link probability between two users
For a given
p_{t}
(
i
) and
p_{t,th}
(
j
), two users
i
and
j
are considered as neighboring nodes if the signal attenuation between them satisfies
where the threshold attenuation is
Let denote Λ(
i
,
j
) the event that there is a wireless link between
i
and
j
which are far way at distance
l
(
i
,
j
). The probability of Λ(
i
,
j
) is given by
From (7), we have
γ
_{2}
(
i
,
j
) =
γ
(
i
,
j
) 
γ
_{1}
(
i
,
j
) . Moreover, when the distance
l
(
i
,
j
) between them is known, the deterministic component of signal attenuation
γ
_{1}
(
i
,
j
) can be directly calculated by (5). Hence, probability of Λ(
i
,
j
) can be calculated by taking integration with respect to
γ
_{2}
(
i
,
j
), i.e.,
Substituting the expressions of
γ
_{1}
(
i
,
j
) and
γ
_{2}
(
i
,
j
) in (5) and (6), respectively, into (11), we obtain
Solving (12) yields
where the disk transmission range
is the transmission range in the case of without shadow fading (
σ
= 0 ), and
erf
(.) is the error function which is defined as
The derivation of (13) from (12) is presented in detail in Appendix A.
 3.2 Number of neighbors of a secondary user
From the probability of having wireless link between two users as in (13), we study the number of neighbors
D
of a specific secondary user. The expected value of
D
can be calculated by taking integration of
ρP
(Λ(
i
,
j
) 
l
(
i
,
j
)) over the entire network, i.e.,
In general, a closedform expression for (16) cannot be obtained. However, it can quickly and accurately be numerically computed with the support of calculation tool such as MATLAB
[22]
. It should be noted that neighbors of a SU can be SUs and PUs. Thus,
E
[
D
] corresponding to neighboring SUs and neighboring PUs of that SU can be obtained by replacing
ρ
in (16) with
ρ_{S}
and
ρ_{P}
, respectively.
 3.3 Communication probability of a secondary user
We have studied the link probability between any two users, i.e. SUSU and SUPU, in Section 3.1. Two users that have a link between each other are called neighbors in the network topology. Based on this derivation, we now investigate the communication probability of a SU in CRAHNs under the impact of spectrum sensing efficiency of SU. The communication probability of a SU means the probability that a secondary transmitter (a secondary receiver) can communicate properly with at least one neighbor SUs while do not interfere with active primary receivers (being interfered by primary transmitters).
From the perspective of SU in CRAHNs, wireless connection of a specific SU exists if the following two conditions are fulfilled:
i)
It has at least one neighboring SU
. From (1), the probability that a SU has no neighboring node is given by
Thus, the probability that a SU has at least one neighboring SU is
where
E
_{SU}
[
D
] is the expected number of SUs which are neighbors of the considered SU.
ii)
It does not interfere with or being interfered by active neighboring PUs
. According to (1), the probability that a SU has
m
PUs as neighbors is
where
E
_{PU}
[
D
] is the expected number of PUs which are neighbors of the examined SU. We should remind that the values of
E
_{SU}
[
D
] in (17) and
E
_{PU}
[
D
] in (19) are computed by substituting
ρ
in (16) with
ρ_{S}
and
ρ_{P}
, respectively.
Moreover, all of these neighboring PUs should be in inactive state with probability given by (2), that is
Then, the probability that a SU does not interfere with or being interfered by any active neighboring PUs in the network is formulated as
Finally, taking into account the primaryuser detection probability
P_{d}
and false alarm probability
P_{f}
, the communication probability of a SU in CRAHNs is given by
In the case of perfect spectrum sensing, i.e.
P_{d}
= 1 and
P_{f}
= 0 , the communication probability of a secondary user becomes
 3.4 Probability of direct communication between two secondary users
In CRAHNs, two secondary users can directly communicate with each other if:
i)
There are no active primary receiver and primary transmitter inside the coverage area of secondary transmitter and secondary receiver, respectively
. Since the impact of secondary transmitter on primary receiver and the impact of primary transmitter on secondary receiver are independent and have the same distribution, from (21) in Section 3.3, the probability that both secondary transmitter and secondary receiver can operate properly is
ii)
Under a certain shadow fading condition, there exists a wireless link between them
. The probability that there exist wireless link between two nodes under shadow fading is given in (13), Section 3.1.
Similarly, the probability of direct communication between two secondary users when primaryuser detection probability
P_{d}
and false alarm probability
P_{f}
are taken into account is
In the case of perfect spectrum sensing, probability of direct communication between two secondary user becomes
4. Numerical results and discussions
In this section, we present numerical results of the effect of shadow fading on the connectivity of CRAHNs. We verify the analytical results by comparing them with simulation results. In the simulation, SUs and PUs are distributed according to a homogeneous Poisson process with density of
ρ_{S}
and
ρ_{P}
, respectively. We conduct simulation by using MATLAB on a computer workstation equipped with 3.5 GHz (Intel Core i73570 Quad) processor, 4 GB of RAM, and Windows 7. In all demonstrated network topologies used in this section, red nodes denote PUs, blue node denotes source SU, green node denotes destination SU, white nodes denote intermediate SUs, blue solid lines denote communication links between two SUs, and dashed red lines denote communication links between PU and SU. The simulation results is calculated by averaging 50000 Monte Carlo simulation network topologies. For each network topology, a new random node’s location is used. Simulation time varies from 0.4 hour to 1.7 hours, depending on the values of network parameters used in the simulation.
Fig. 3
illustrates the difference in communication possibility of a SU in non fading and shadow fading environment. Specifically,
Fig. 3
(a) and
Fig. 3
(b) depict the cases where SU is not affected by any active PUs. For non fading situation as in
Fig. 3
(a), a SU only has wireless connection with other SUs staying inside its circular transmission area. However, for shadowing fading condition as in
Fig. 3
(b), a SU may have wireless link with other SUs staying outside its transmission area in
Fig. 3
(a). The wireless link establishment between active PUs and SUs also has the same behavior, which results in different communication probability of a specific SU. For example, with the same distance between an active PU and a SU, this SU is allowed to communicate with other SUs inside its transmission area as in
Fig. 3
(c), i.e. the case of non fading, because the distance from it to an active PU is larger than transmission range. Meanwhile, in
Fig. 3
(d), due to the effect of shadow fading, the wireless link between an active PU and a SU is possible. Thus, this SU is not allowed to communicate with other SUs. In the reverse scenario, if the distance between an active PU and a SU is smaller than transmission range, this SU is not allowed to communicate with other SUs inside its transmission area as in
Fig. 3
(e), i.e. the case of non fading. Nevertheless, this situation may not happen in
Fig. 3
(f), i.e. the case of shadowing fading. Athough the distance between an active PU and a SU is the same as in
Fig. 3
(e), the wireless link between PU and SU does not exist due to the effect of shadow fading. Consequently, the SU is allowed to communicate with other SUs.
Illustration of communication possibility of a SU in CRAHNs in non fading (σ = 0) and shadow fading (σ = 4) environment; N_{S} = 100, N_{P} = 10, λ_{P} = 0.3, α = 3, γ_{th} = 70 dB
Fig. 4
(a) shows the communication probability of SU in CRAHNs in the case of perfect spectrum sensing (
P_{d}
= 1,
P_{f}
= 0) of SU versus SU’s density for different shadow fading degree. For comparison, the communication probability of AHNs versus node’s density in the same fading conditions is presented in
Fig. 4
(b). The communication probability of a SU in CRAHNs means the probability that a SU has at least one neighboring SU and available spectrum band to communicate with these neighboring SUs. From
Fig. 4
(a), we can see that higher SU’s density and higher shadow fading degree increase the communication probability of SU in CRAHNs. Particularly, as density of SU
ρ_{S}
increases, communication probability of SU increases sharply in shadow fading environment with
σ
= 8 dB, reaching stable value of around 0.98 at
ρ_{S}
= 0.4×10
^{3}
node/m
^{2}
. Meanwhile, communication probability of SU reaches stable value at
ρ_{S}
= 0.6×10
^{3}
node/m
^{2}
in the shadow fading environment with
σ
= 4 dB. In non shadowing environment, i.e.
σ
= 0 dB, communication probability of SU requires higher SU’s density,
ρ_{S}
= 0.7×10
^{3}
node/m
^{2}
, to reach stable value. The same behavior of commnication probability can be observed in
Fig. 4
(b) for the case of AHNs, except that the commnication probability of wireless node reaches stable value faster especially when
σ
= 8 dB. It is because wireless nodes have more opportunity to communicate with each other when there are no PUs in the network. For other conditions, i.e.
σ
= 4 dB and
σ
= 0 dB (non fading), the values of commnication probability in AHNs and CRAHNs are insignificantly different. It may because the PU’s density,
ρ_{P}
= 3×10
^{6}
node/m
^{2}
, used in the simulation of CRAHNs is not very high.
Comparison of the communication probability of SU in CRAHNs in the case of perfect spectrum sensing and of wireless node in AHNs versus node (SU)’s density for different shadow fading conditions; ρ_{P} = 3×10^{6} nodes/m^{2}, λ_{P} = 0.3, α = 3, γ_{th} = 50 dB
In constrast to
Fig. 4
(a),
Fig. 5
depicts the communication probability of SU in CRAHNs in the case of imperfect spectrum sensing (
P_{d}
= 0.
8
,
P_{f}
= 0.1) of SU versus SU’s density for different shadow fading degree. As can be seen in
Fig. 5
, the spectrum sensing efficiency of SU greatly influences its communication probability. Particularly, the maximum communication probability of SU in
Fig. 5
is much lower than that in
Fig. 4
(a). An important feature which can be seen in
Fig. 5
is that when the influence of PU is small (i.e. Θ
_{com}
in (22) goes to 1), the communication probability of SU is
P_{com}
≈ Φ
_{com}
‧
P_{d}
. In other words, the correct primaryuser dectection efficiency of SU directly relates to its achievable maximum communication probability. This observation is confirmed by simulation results in
Fig. 5
.
Communication probability of SU versus SU’s density in the case of imperfect spectrum sensing of SU (P_{d} = 0.8, P_{f} = 0.2) for different shadow fading conditions
Fig. 6
shows the comparison of the connection probability of a SU in CRAHNs versus the average active rate of PU for different shadow fading conditions and primaryuser detection ability of SU. As observed from both
Fig. 6
(a) and
Fig. 6
(b), the impact of shadow fading degree on connection probability of a SU in CRAHNs dominates that of the average active rate of PU. In particular, increasing the average active rate of PU does not reduce much the wireless connection probability compared with reducing SU’s density. However, high fading variance
σ
greatly ‘helps’ to improve the communication probability of a SU. This surprising effect can be explained as follows: For a given SU, shadow fading may take away wireless links to other SUs that locate within a distance
r_{0}
from the considered SU, but in turn, it adds wireless links to nodes that locate further away. On average, the number of added links is higher than the number of removed links because the number of potential neighboring SUs of a given SU is exponentially proportional to the distance, i.e.
l
(
i
,
j
) , from them to that SU. Another observation from
Fig. 6
(b) is that the imperfect primaryuser detection ability of SU, together with higher active rate of PU, reduces its communications probability in the same network conditions used in
Fig. 6
(a). The slight difference between simulation results and analysis results can be explained as follows. Similar to all previous works in the literature, for simplicity of theoretical expressions, all wireless nodes are assumed to be placed in infinite network area. Thus, the
effective coverage areas
of wireless nodes are always circular. However, to model real network circumstance, we simulate with finite network area. Consequently, wireless nodes which are near the edge of network area do not have perfect circular coverage area. This fact is called
border effect
, which already discussed in
[23]
. The border effect is alleviated as the network area and node density increase.
Comparison of the communication probability of SU versus PU’s average active rate in the case of (a) perfect spectrum sensing and (b) imperfect spectrum sensing of SU for different shadow fading conditions; ρ_{S} = 4×10^{3} node/m^{2} , ρ_{P} = 3×10^{6} node/m^{2}, α = 3, γ_{th} = 50 dB
Next, we will study the possibility of having direct communication link between two SUs locating at a relative distance
l
in CRAHNs with shadow fading environment.
Fig. 7
consists of several network topologies to illustrate the direct communication possibility between two SUs in CRAHNs in shadow fading environment. As we know, two SUs can communicate directly if: (i) none of them is affected by any active PUs and (ii) they can establish a direct communication link between them.
Fig. 7
(a),
Fig. 7
(b), and
Fig. 7
(c) depict the cases where two SUs cannot communicate directly because secondary transmitter, secondary receiver, and both secondary transmitter and secondary receiver do not allowed to work properly.
Fig. 7
(d) presents the case where two SUs can sucessfully establish direct communication link (represented as bold blue line) between them due to these SUs are not affected by any active PUs and the power attenuation between them is less than the threshold
γ_{th}
= 80 dB.
Illustration of direct communication possibility between two SUs in CRAHNs with shadow fading environment; ρ_{S} = 1×10^{4} node/m^{2} , ρ_{P} = 1×10^{5} node/m^{2}, λ_{P} = 0.1, α = 3, σ = 4 dB, γ_{th} = 80 dB
Fig. 8
shows the probability of having wireless link between two nodes (SUs) versus
l
/
r_{0}
for
α
= 2 and
α
= 3 with different values of shadow fading degree
σ
and primaryuser detecting ability of SU. As observed from
Fig. 8
, the relative distance between two users as well as fading degree have significant impact on the possibility of being neighbors of two users in both CRAHNs and AHNs. Particularly, when the distance between two SUs is smaller than the disk transmission range
r_{0}
correlating with the deterministic component of signal attenuation, two SUs have significantly high possibility to communicate directly. In AHNs, as the distance between two nodes increases, the probability that they can establish a direct communication link remarkably reduces. In addition, the reducing rate of direct communication probability of two nodes depends on the path loss exponent
α
. The lower
α
is, the lower reducing rate of direct communication probability is. It is because path loss exponent
α
affects the disk transmission range
r_{0}
as given by (14). For example, as shown in
Fig. 8
(a) and
Fig. 8
(b), with
γ_{th}
= 50 dB considered in this analyzing scenario,
α
= 2 corresponding to
r_{0}
= 316.228 m provides lower reducing rate of direct communication probability of two nodes than when
α
= 3 corresponding to
r_{0}
= 46.416 m. In CRAHNs, in the case of perfect spectrum sensing of SU (
P_{d}
= 1,
P_{f}
= 0), the pattern of direct communication probability of two SUs when
α
= 3 (refer to
Fig. 8
(d)) is quite similar to that of AHNs. However, when
α
= 2 (refer to
Fig. 8
(c)), the pattern of direct communication probability of two SUs is significantly different from that of AHNs. More specifically, when
l
/
r_{0}
decreases, the maximum value of direct communication probability of two SUs in CRAHNs is noticeably lower compared with AHNs. It is due to the fact that lower path loss exponent
α
results in larger disk transmission range
r_{0}
, which increases the possibility of having active PUs interfere with communication of SUs.
Comparison of the probability that two SUs can establish a direct communication link vesus the relative distance between them for different fading conditions and spectrum sensing efficiency of SU and that in AHNs; ρ_{S} = 1×10^{4} node/m^{2} , ρ_{P} = 3×10^{6} node/m^{2}, λ_{P} = 0.1, γ_{th} = 50 dB
The effect of imperfect spectrum sensing of SU on the probability of direct communication between two SU is also studied and the results are plotted in
Fig. 8
(e) and
Fig. 8
(f). We can see that the patterns of
Fig. 8
(e) and
Fig. 8
(f) are similar to those in
Fig. 8
(a) and
Fig. 8
(d), except that the maximum achievable link probability is remarkably lower. This is because the decrease in primaryuser dectection ability of SU reduces the communication possiblility of both secondary transmitter and secondary receiver and thus, results in much lower maximum achievable direct communication probability.
In general, the simulation results in
Fig. 8
are in good agreement with the analytical results. Only when path loss exponent
α
is small (
α
= 2 in this case) and the distance between secondary transmitter and secondary receiver is less than the disk transmission range, there is a gap between the simulation results and analysis results. The explanations for this observation are follows. According to (16), to obtain analytical result of expected number of neighbors (SUs and PUs) of a SU, we take integration of
P
(Λ(
i
,
j
) 
l
(
i
,
j
)) with respect to
l
(
i
,
j
) over the infinite network area, i.e. the values of
l
(
i
,
j
) are from 0 to infinite. In addition,
P
(Λ(
i
,
j
) 
l
(
i
,
j
)) itself is a function of
α
. Thus, when path loss exponent
α
is small and the distance
l
(
i
,
j
) between transmitter
i
and receiver
j
goes to 0, the impact of boundary effect on the gap between simulation results and analysis results is exponentially higher because in simulation scenarios the possible values of
l
(
i
,
j
) are only from 0 to a finite number. This gap is reduced when the border effect is mitigated.
We are now interested in investigating the communication probability of two arbitrary SUs in CRAHNs with shadow fading environment. It is noted that the communication of two arbitrary SUs includes both direct communication and indirect communication, i.e. communication through several intermediate SUs on multihop path.
Fig. 9
(a) and
Fig. 9
(b) present the cases where source SU (green node) cannot communicate with destination SU (blue node) because destination node or both source node and destination node are affected by active PUs, respectively. In
Fig. 9
(c) and
Fig. 9
(d), source SU and destination SU are not affected by any active PUs. There exist multihop paths between source SU and destination SU in
Fig. 9
(c). However, there are no paths between these two nodes in
Fig. 9
(d).
Illustration of multihop communication possibility between two SUs in CRAHNs with shadow fading environment; ρ_{S} = 1×10^{4} node/m^{2} , ρ_{P} = 1×10^{5} node/m^{2}, λ_{P} = 0.3, α = 3, σ = 4 dB, γ_{th} = 60 dB
Fig. 10
shows the comparison of the communication probability of a SU and multihop path connectivity between two arbitrary SUs in CRAHNs versus SU’s density for different fading conditions and spectrum sensing efficiency. As we can see in
Fig. 10
, in the same fading condition, multihop path connectivity is significantly lower than the communication probability of a SU. It is because the connectivity of multihop path not only closely depends on the communication probability of a SU but also depends on the path length in terms of hop count. With the same communication probability of a SU, the longer that path is, the lower possibility that source node and destination node can be connected. As shown in
Fig. 10
(b), the decrease in spectrum sensing efficiency greatly reduces the communication probability of a SU and multihop path connectivity between two arbitrary SUs compared with those in
Fig. 10
(a).
Comparison of the communication probability of a SU and multihop path connectivity between two arbitrary SUs in CRAHNs versus density of SU with different fading conditions; ρ_{P} = 3×10^{6} node/m^{2}, λ_{P} = 0.3, α = 3, γ_{th} = 50 dB
Fig. 11
shows the multihop connectivity of two arbitrary SUs in CRAHNs versus SU’s density for different fading conditions and spectrum sensing efficiency. From
Fig. 11
, we can observe some interesting features as follows. When
γ_{th}
= 50 dB, the higher shadow fading degree, i.e. higher value of
σ
, provides higher multihop connectivity as can also be seen in
Fig. 10
. However, when
γ_{th}
is increased to 65 dB, the same behavior does not happen. It is because the disk transmission range
r_{0}
corresponding to the deterministic component of signal attenuation depends on the value of signal attenuation threshold as expressed in (14). The values of
r_{0}
are 46.416 m and 146.780 m when
α
= 3,
γ_{th}
= 50 dB and 65 dB, respectively. The significant increase in disk transmission range
r_{0}
together with high shadow fading degree results in more possibility that SU will be interfered by active PUs. Consequently, the stable value of multihop connectivity in the case of higher shadow fading degree is smaller than that in the case of lower shadow fading degree. We can also see that in the same network conditions, the multihop connectivity in
Fig. 11
(b) is much lower than that in
Fig. 11
(a) due to the degrading spectrum sensing efficiency of SU.
Multihop connectivity of two arbitrary SUs in CRAHNs versus density of SU for different fading conditions and spectrum sensing efficiency; ρ_{P} = 3×10^{6} node/m^{2}, λ_{P} = 0.3, α = 3
5. Conclusion
We have studied the connectivity of CRAHNs in shadow fading environment. As opposed to previous research works on the connectivity of CRAHNs in the literature, we take into account the stochastic shadowing effects between two users. The investigation into the connectivity of CRAHNs in fading environment is exhaustively conducted in three aspects: communication probability of a SU, direct communication link probability, and multihop path connectivity of two SUs. Using both analytical and simulation methods, we observe several interesting characteristics of the impact of shadowing and PU’s existence on the connectivity of CRAHNs: (i) for a given value of path loss exponent
α
, a higher fading variance
σ
improves the connectivity, (ii) the average active rate of PU does not have noticeable impact on the connectivity compared to that of SU density and shadow fading degree, (iii) the multihop connection probability of two arbitrary SUs is significantly lower than communication probability of a SU with the same network condition, and the stable value of multihop connectivity in the case of higher shadow fading degree is smaller than that in the case of lower shadow fading degree, and (iv) the spectrum sensing efficiency of SU greatly affects the connectivity of secondary network. The analysis in this paper can be used as a framework when considering the connectivity of CRAHNs with other kinds of fading effects. Moreover, the results in this paper can be combined with the results of connectivity dynamics, e.g. the stochastic properties of path duration between two nodes
[24

25]
in the literature, for designing and evaluating more practical CRAHNs.
BIO
Le The Dung received the B.S. degree in Electronics and Telecommunication Engineering from Ho Chi Minh City University of Technology, Vietnam, in 2008 and the M.S. degree in Electronics and Computer Engineering from Hongik University, Korea, in 2012. From 20072010, he joined Signet Design Solutions Vietnam as hardware designer. He is currently working toward the Ph.D. degree in Electronics and Computer Engineering with Hongik University, Korea. His major interests are routing protocols, network coding, network stability analysis and optimization in mobile adhoc networks and cognitive radio adhoc networks. He is a student member of the IEEE and the IEIE.
Beongku An received the M.S. degree in Electrical Engineering from the New York University (Polytechnic), NY, USA, in 1996 and Ph.D. degree from New Jersey Institute of Technology (NJIT), NJ, USA, in 2002, respectively. After graduation, he joined the Faculty of the Department of Computer and Information Communications Engineering, Hongik University in Korea, where he is currently a Professor. From 1989 to 1993, he was a senior researcher in RIST, Pohang, Korea. He also was lecturer and RA in NJIT from1997 to 2002. He was a president of IEIE Computer Society (The Institute of Electronics and Information Engineers, Computer Society) in 2012. From 2013, he also works as a General Chair in the International Conference, ICGHIT (International Conference on Green and Human Information Technology). His current research interests include mobile wireless networks and communications such as adhoc networks, sensor networks, wireless internet, cognitive radio networks, ubiquitous networks, and cellular networks. In particular, he is interested in cooperative routing, multicast routing, energy harvesting, physical layer security, visible light communication (VLC), and crosslayer technologies. Professor An was listed in Marquis Who’s Who in Science and Engineering in 20062011, and Marquis Who’s Who in the World in 20072014, respectively.
View Fulltext
FCC
2002
“Spectrum policy task force,”Technical Report
Chiu S. N.
,
Stoyan D.
,
Kendall W. S.
,
Mecke J.
2013
Stochastic Geometry and Its Application
3rd Ed.
Wiley
Meester R.
,
Roy R.
2008
Continuum Percolation
1st Ed.
Cambridge University Press
Chowdhury K. R.
,
Felice M. D.
2009
“Search: A routing protocol for mobile cogntive radio adhoc networks,”
Computer Communications
32
(18)
1983 
1997
DOI : 10.1016/j.comcom.2009.06.011
Cacciapuoti A. S.
,
Callefi M.
,
Paura L.
2012
“Reactive routing for mobile cognitive radio ad hoc networks,”
Ad Hoc Networks
10
(5)
803 
815
DOI : 10.1016/j.adhoc.2011.04.004
Ghosh A.
,
Das S. K.
2008
“Coverage and connectivity issues in wireless sensor networks: A survey,”
Pervasive and Mobile Computing
4
(3)
303 
334
DOI : 10.1016/j.pmcj.2008.02.001
Abbagnale A.
,
Cuomo F.
2012
“Leveraging the Algebraic Connectivity of a Cogntive Network for Routing Design,”
IEEE Transactions on Mobile Computing
11
(7)
1163 
1178
DOI : 10.1109/TMC.2011.125
Ren W.
,
Zhao Q.
,
Swami A.
2011
“Connectivity of Heterogeneous Wireless Networks,”
IEEE Transactions on Information Theory
57
(7)
4315 
4332
DOI : 10.1109/TIT.2011.2145650
Lu D.
,
Huang X.
,
Liu P.
,
Fan J.
“Connectivity of LargeScale Cognitive Radio Ad Hoc Networks,”
in Proc. of 2012 IEEE INFOCOM
March 2012
1260 
1268
Liu J.
,
Zhang Q.
,
Zhang Y.
,
Wei Z.
,
Ma S.
“Connectivity of Two Nodes in Cognitive Radio Ad Hoc Networks,”
in Proc. of 2013 IEEE Wireless Communications and Networking Conference (WCNC)
April 2013
1186 
1191
Liu D.
,
Liu E.
,
Zhang Z.
,
Wang R.
,
Ren Y.
,
Liu Y.
,
Ho I. WH.
,
Yin X.
,
Liu F.
2014
“Secondary Network Connectivity of Ad Hoc Cognitive Radio Networks,”
IEEE Communications Letters
18
(12)
2177 
2180
DOI : 10.1109/LCOMM.2014.2362766
Bettstetter C.
,
Hartmann C.
2005
“Connectivity of Wireless Multihop Networks in a Shadow Fading Environment,”
Wireless Networks
11
(5)
571 
579
DOI : 10.1007/s112760053513x
Zhou X.
,
Durrani S.
,
Jones H. M.
“Connectivity of Ad Hoc Networks: Is Fading Good or Bad,”
in Proc. of ICSPCS 2008
December 2008
1 
5
Xu B.
,
Zhu Q.
“Analysis of connectivity in Ad Hoc network with Nakagamim fading,”
in Proc. of 2014 International Conference on Information Science, Electronics and Electrical Engineering (ISEEE)
April 2014
1609 
1612
Zhai D.
,
Sheng M.
,
Wang X.
,
Zhang Y.
“Local Connectivity of Cognitive Radio Ad Hoc Networks”
in Proc. of GLOBECOM’14
December 2014
1078 
1083
Liu D.
,
Liu E.
,
Ren Y.
,
Zhang Z.
,
Wang R.
,
Liu F.
2015
“Bounds on Secondary User Connectivity in Cognitive Radio Networks,”
IEEE Communications Letters
19
(4)
617 
620
DOI : 10.1109/LCOMM.2015.2404436
Baccelli F.
,
Blaszczyszyn B.
2010
Stochastic Geometry and Wireless Networks: Volume 1: Theory
Now Publishers Inc.
Rappaport T. S.
2002
Wireless Communication: Principles and Practice
2nd Ed.
Prentice Hall
Koivo H. N.
,
Emusrati M.
2009
Systems Engineering in Wireless Communications
John Wiley & Sons
Xue D.
,
Chen Y.
2009
Solving Applied Mathematical Problems with MATLAB
CRC Press
Bettstetter C.
“On the Minimum Node Degree and Connectivity of a Wireless Multihop Network,”
in Proc. of 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '02)
June 2002
80 
91
Wu YuehTing
,
Liao Wanjiun
,
Tsao ChenLin
,
Lin TsungNam
2009
“Impact of node mobility on link duration in multihop mobile networks,”
IEEE Transactions on Vehicular Technology
58
(5)
2435 
2442
DOI : 10.1109/TVT.2008.2008190
Dung L. T.
,
An B.
2012
“A modeling framework for supporting and evaluating performance of multihop paths in mobile adhoc wireless networks,”
Computers and Mathematics with Applications
64
(5)
1197 
1205
DOI : 10.1016/j.camwa.2012.03.063