# Maximizing Throughput with Wireless Spectrum Sensing Network Assisted Cognitive Radios

Authors: Arbab Waheed Ahmad; Heekwon Yang; Chankil Lee
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

In a cognitive radio network (CRN), secondary users (SUs) utilize primary users (PUs) licensed spectrum in an opportunistic manner. Spectrum sensing is of the utmost importance in CRN to find and use the available spectrum without harmful interference to the PUs. Conventionally, to implement spectrum utilization, SUs are required to sense the primary spectrum first and then transmit data on the available spectrum. In this paper, we propose a dedicated wireless spectrum sensing network (WSSN), eliminating sensing overhead from SUs with the aim of improving achievable throughput. With WSSN assistance, we eliminate sensing time from the SUs frame, hence increasing the transmission time, which maximizes the achievable throughput. Additionally, the sensing duration is increased by deploying a dedicated WSSN, decreasing the probability of false alarm and achieving a targeted high probability of detection. A low probability of false alarm increases the spectrum utilization, improving the achievable throughput, while a high detection probability ensures PUs protection. Moreover, the proposed technique also addresses hidden and exposed terminal problems along with smooth spectrum mobility. Finally, we provide simulation results to demonstrate the proposed techniques, effectiveness. In the results, we have compared the achievable throughput of the proposed scheme with that of conventional CRN.


---

## Body

## 1. Introduction

The electromagnetic spectrum is one of the precious natural resources used for radio communication. The regulatory body, that is, the Federal Communication Commission (FCC), allocates this spectrum to the licensed users of certain geographical locations, while some portion is kept license-free. The significant underutilization of the licensed spectrum accompanied by the substantial overutilization of the unlicensed spectrum has demanded the need for dynamic spectrum access. Such a paradigm improves the spectrum’s utilization by exploiting the code, temporal, and spatial variations of different spectrum bands. Cognitive radios based on dynamic spectrum access have been a topic of interest for researchers in recent years. The cognitive radio network (CRN) is composed of unlicensed users, also known as secondary users (SUs), capable of cognition and reconfiguration properties. In particular, the cognition cycle includes radio environment sensing, spectral hole identification, information analysis, and spectrum decisions that are used for temporary data transmission. Spectral holes are the bands legally assigned to licensed users, also known as primary users (PUs), but are not used by primary transmitters at specific times and specific locations. In addition, reconfiguration takes into account the organization of transceiver parameters according to the sensed radio environment. However, being a different scheme from traditional communication networks, dynamic spectrum access is technically challenged by several factors. For instance, in dynamic spectrum access, to identify the spectral hole from a wide range of frequencies, SUs require wide band transceiver implementation along with a quick decision algorithm. Second, dynamic spectrum access entails SUs ability not to disturb PUs transmission. Hence, SUs must return the spectrum back, as PUs start transmission. Further, SUs should coordinate among themselves to share the available spectral hole in a friendly manner. Moreover, in current CRN technology, SUs are unable to measure the interference at a PUs receiver. Such inaccurate sensing, poor response time, hardware limitations, and PU restrictions remain challenges for researchers.In the literature, spectrum sensing and access techniques have been extensively investigated with the general objective of maximizing the CRN throughput without violating the interference limits of the licensed network. Such schemes are mainly categorized into two classes: centralized spectrum access (CSA) and distributed spectrum access (DSA). In CSA, a single central entity gathers the spectrum measurements and makes spectrum access decisions solely on its own information. For example, the authors of [1] used a graph-theoretic approach, where a spectrum server is deployed to find the optimal schedules in order to maximize the average sum rate given the minimum average rate constraint. Meanwhile, in [2], based on the IEEE 802.22 WRAN standard, infrastructure-based network model is utilized where base stations are responsible for spectrum access and management. On the other hand, DSA techniques rely on the individual or cooperative decision of the cognitive users in a decentralized manner. Several DSA techniques have been proposed in the literature for the CRN. For instance, the authors of [3] adopt a game theoretic scheme to propose a price-based spectrum model for cognitive radios. In their work, CRN is modeled as a noncooperative game that uses price-based iterative water-filling algorithm to reach Nash equilibrium. Moreover, [4] used a randomized sensing combined with a probabilistic and nongreedy transmission policy to counter the unavoidable inaccuracies in spectrum measurements. In their novel RAP-MAC protocol, they allow SUs to better explore the spectral holes randomly, regardless of spectrum sensing inaccuracy, enabling multiple secondary flows to share the available spectrum in a distributed manner. Meanwhile, [5] presents a novel game-theoretic channel sharing scheme that allows SUs to freely optimize the channel utilization to transmit PUs data along with their own data.The frame structure of DSA cognitive radios is comprised of sensing time and data transmission time, as shown in Figure1 [6]. According to the frame structure, first, the cognitive user senses the spectrum for a specific time duration. Then, the user starts data transmission if a PU is not available. According to [7], a longer sensing time results in precise spectrum sensing, ultimately avoiding interference with the licensed network. However, on the other hand, an increase in sensing time results in a decrease in transmission time, leading to low throughput. Hence, there is always a trade-off between perfect sensing and throughput. This contrast has been discussed in [7], where the authors have tried to find the optimal sensing time, aiming at maximizing throughput along with ensuring no harmful interference with PUs. In the aforementioned spectrum access schemes, CSA is totally governed by an infrastructure-based system providing spectrum access to SUs. Taking into account an unlicensed user, the sensing time is approximately negligible in centralized spectrum access as the SU is not directly involved in spectrum sensing. The SU requests the spectrum to the centralized entity, which allocates the available spectral hole to the SU based on its own measurements. Thus the sensing time can be neglected in CSA, increasing the throughput of the CRN, as shown in Figure 2(a). However, CSA requires expensive infrastructure that is not economically recommendable. Alternatively, in the DSA technique, as shown in Figure 2(b), the cognitive user accesses the spectrum itself, which wastes a significant amount of time in sensing, resulting in decreased throughput. Thus, a scheme is needed that can increase the throughput of the cognitive network with low-cost infrastructure. This is the main motivation for this work. This paper proposes a dedicated wireless spectrum sensing network (WSSN) for the CRN that overwhelms the sensing time versus throughput tradeoff. In the proposed scheme, the throughput has been maximized by separating the sensing portion from the SU architecture; instead of infrastructure based sensing network a cost effective dedicated ad hoc WSSN is deployed, giving the idea of hybrid spectrum access. Whenever SUs need spectrum access, they send channel requests to the dedicated WSSN on a separate control channel. The proposed system model and SU/WSSN network handshake algorithm are explained in more detail in the next section. Furthermore, the proposed scheme also addresses the hidden terminal problem and missed opportunity due to an exposed primary transmitter [4]. The major contributions of this work are maximizing the CRN throughput, lowering the SU architecture complexity by removing the sensing portion, improving the ease of spectrum mobility, and minimizing the sensing time with the aid of a dedicated WSSN network.Figure 1
Frame structure of the conventional CRN [6].Figure 2
Frame structures.
(a)
Frame structure of the centralized CRN
(b)
Frame structure of the distributed CRNThe rest of this paper is organized as follows. The proposed scheme is described in detail in Section2. In Section 3, the throughput analysis of the proposed scheme is discussed. Finally, the simulation results are presented and discussed in Section 4, whereas Section 5 concludes the paper.


## 2. Proposed System Model

In this section, first, we present a general network overview and then we explain the hybrid nature of the proposed system. Later, a spectrum allocation algorithm and a modified cognition cycle are described. Finally, the proposed scheme presents a smooth spectrum transition along with the solution to hidden and exposed terminal problems.


### 2.1. Sensing Network Overview

Here we present an inclusive overview of the scenario. As shown in Figure3, a number of sensor nodes are deployed around a PU transmitter to cover a specific geographical area. The SU transmitter and receiver are located in the PU network range.Figure 3
Network overview of the proposed CRN.In this work, we propose a dedicated WSSN to identify spectral holes for the CRN. The WSSN is an ad hoc network comprised of several sensor nodes with an enhanced spectrum sensing capability, that is, equipped with wide-band transceivers. Sensor nodes inside the WSSN can be installed in two different setups: (i) a single sensor per location, where only a single sensing node is deployed to sense spectral holes in its coverage area; (ii) multiple sensors per location, where multiple sensors can sense spectral holes for the same coverage area. Sensor nodes inside the WSSN network communicate on a common control channel of the assumed wireless sensor network technology. A coordinator of the WSSN serving as the fusion center (FC) is adopted to collect results from the sensing nodes, and it maintains the records in a table, termed the information table (IT) in this work. After obtaining data from all sensor nodes, the FC updates its IT and hence is up-to-date with all geographical locations at any instant. The FC is responsible for providing spectrum availability to the SU of the CRN. Moreover, the sensor nodes use the most popular energy detection [8] model for spectrum sensing because it is easy to implement and requires no prior knowledge about the primary signal(1)
H
0
:
y
t
=
n
t
,
H
1
:
y
t
=
h
x
t
+
n
t
,where x
(
t
) is the PU signal to be detected at the sensor node transceiver, n
(
t
) is AWGN, and h is the channel gain from the PU transmitter to the sensing node receiver. H
0 is the null hypothesis that there is no primary signal in the licensed band, while H
1 supports the existence of a PU signal. The energy detection can be defined as the average energy of N observed samples and is given by (2)
Y
=
1
N
∑
t
=
1
N
‍
y
t
2
.The decision as to whether the spectrum is occupied by the PU is made locally by each sensor by comparing the measurement with the predetermined threshold.


### 2.2. Frame Structure and Hybrid Nature

The proposed system combines good features of centralized and distributed spectrum access schemes and is therefore a hybrid system. Unlike the aforementioned CSA and the similar DSA, the proposed hybrid scheme is an infrastructure-less ad hoc wireless sensor network. The frame structure of the proposed hybrid system is similar to CSA, as shown in Figure4, where sensing and transmission are performed in parallel for a complete frame duration T. The significance of this frame structure is that sensing and transmission times are simultaneously increased. The increased spectrum sensing time results in the following:(1)
an improved detection probability that ensures better protection of the PU from harmful interference;
(2)
a reduced false alarm probability that increases spectrum utilization, improving the achievable throughput;
(3)
the optimization of sensing time, and the sensing time-throughput trade-off problem is overwhelmed.Figure 4
Frame structure of the proposed WSSN-assisted CRN.On the other hand, unlike the DSA technique, the proposed WSSN scheme eliminates the sensing time slot from the conventional frame structure, which is the better half of CSA. The advantage of eliminating the sensing slot from the conventional frame structure is that now this slot is also used for data transmission, which maximizes the achievable throughput. Cognitive users only request the FC for the spectrum when it needs to transmit data.


### 2.3. SU-WSSN Handshake Algorithm

When an SU needs to transmit data, it will contact the FC directly. If the FC is not accessible to the SU, sensor nodes have the ability to route its request to the FC. Note that sensor nodes can only route the channel request and channel grant message but cannot grant the channel to the SU based on their own decision. We assume a separate control channel for the WSSN-SU communication. The channel allocation algorithm is carried out through the following steps.(1)
The SU broadcasts a channel request ch_req packet on a separate control channel and starts its timer. The FC receives the request from the SU directly; if the FC is not in the SUs range, the nearby sensor node redirects the ch_req packet to the FC. The described packet contains the SU transmitter location, the SU receiver location, the maximum transmit power, and the maximum amount of data to be sent over the primary channel. The FC discards multiple copies of one request.
(2)
Upon receiving the ch_req packet, the FC examines the IT table measurements.
(3)
Based on IT table measurements, two cases can occur.
(a)
If the spectrum is available, the FC sends the channel grant ch_grt packet to the SU. The described packet contains information about the available spectrum, its bandwidth, the maximum data-rate, and the maximum allowable transmission power.
(b)
If the spectrum is not available, the FC sends the channel reject ch_rjt packet to the SU.
(4)
Upon receiving the ch_grt packet, the SU acknowledges the FC by transmittingack packet and starts data transmission on the allocated channel. In the second case, after time-out, the SU again requests the channel.
(5)
When the PU starts transmission on the primary channel, the FC sends a channel stop ch_stp packet to the SU in order to ensure the QoS of the PU. It also updates the SU with the new available spectrum for smooth and quick channel mobility.


### 2.4. Modified Cognition Cycle

As shown in Figure5, the architecture of the cognition cycle given in [9] is modified according to the proposed scheme. Compared to the traditional cognition cycle, the sensing part is moved outside of the traditional cognition cycle. Spectrum sensing is the responsibility of the dedicated WSSN network. The dedicated WSSN network will decide the spectrum band, the channel bandwidth, the maximum data rate, and the maximum allowable transmission power. Further, if the PU starts transmission on the specified spectrum, the FC can stop the SUs transmission. In other words, cognitive terminal complexity has been lowered by eliminating the sensing portion from the SUs architecture.Figure 5
Modified cognition cycle. The spectrum is analyzed by WSSN. The FC provides spectrum information that is used by the CRN to adapt to new parameters shown by the dotted lines.


### 2.5. Spectrum Mobility

Spectrum mobility [10] refers to the spectrum change made by a cognitive user when a PU starts data transmission on its licensed band. The purpose of spectrum mobility is to guarantee smooth and fast channel changeover, resulting in minimum performance degradation. The important prerequisite of spectrum mobility is information regarding the available spectral holes and the time duration required for smooth channel transitions. The availability of the spectrum ensures in-time and fast transitions in spectrum mobility. Zhu et al. [11] show through Markov chain analysis that the channel reservation and spectrum handoff significantly increase the throughput of cognitive users. In a performance evaluation, they present that the channel reservation reduces the force termination probability with a small increase in the blocking probability. In the proposed WSSN-assisted CRN system, the FC provides SUs with the backup reserved spectrum information based on its IT measurements. Thus, having the spectrum information, ongoing communication can be well-preserved with minimum performance degradation and enhanced throughput. Moreover, Park et al. in [12] present a stochastic model for a cognitive radio sensor network. In their work, they claim that the probability of force termination and the probability of blocking are both considerably decreased while the throughput has been enhanced by the channel reservation and spectrum mobility. The optimum number of reserved channels and system modeling based on the Markov chain are beyond the scope of this work.


### 2.6. Hidden and Exposed Terminal Problems

The hidden terminal problem [13] refers to the scenario in which PU transmission is occurring and is mistakenly inferred as a spectral hole. Consider the case, as shown in Figure 6(a), in which the PU transmitter transmits data to the PU receiver. If the SU is equipped with sensing capability, it is still unable to detect the PU transmitter, due to the hidden terminal problem. In the proposed scheme, the SU will request the FC of the WSSN network for the spectrum. The sensing network consists of several nodes that continuously sense the spectrum and update the FC accordingly. If there is a PU transmitter, the FC is aware of its existence, even in the situation in which the SU cannot sense the PU, as shown in Figure 6(a). Hence, by deploying WSSN nodes, the hidden terminal problem is solved without any additional sensing arrangement.Figure 6
Terminal problems.
(a)
Solving the hidden terminal problem. The primary transmitter is transmitting and is hidden to the secondary transmitter conventionally. In the proposed scheme, secondary users access the spectrum with the FCs approval. For the FC, the primary transmitter is not a hidden terminal
(b)
Solving the exposed terminal problem. The FC, knowing the location information, grants the spectrum to the SUOn the other hand, the exposed terminal problem [4] is considered a missed opportunity and is defined as the situation in which the spectrum is available but is mistakenly sensed as being occupied by the PU. Consider the scenario, as shown in Figure 6(b), in which the PU transmitter is transmitting data to the PU receiver. Here, the PU transmitter is near to the SU transmitter, while PU receiver is far away from the SU transmitter. In addition, the SU receiver is at the other side relative to the PU transmitter and receiver, as shown in the figure. Hence, in this case, the SU transmitter can transmit to the SU receiver without interfering with the primary network. However, due to a position dilemma, the SU transmitter senses that the primary network is occupied, resulting in a missed opportunity. In the proposed scheme, the IT table of the FC possesses the location information. Hence, the missed opportunity due to the exposed terminal problem is solved by the dedicated WSSN network with no additional setup required.


## 2.1. Sensing Network Overview

Here we present an inclusive overview of the scenario. As shown in Figure3, a number of sensor nodes are deployed around a PU transmitter to cover a specific geographical area. The SU transmitter and receiver are located in the PU network range.Figure 3
Network overview of the proposed CRN.In this work, we propose a dedicated WSSN to identify spectral holes for the CRN. The WSSN is an ad hoc network comprised of several sensor nodes with an enhanced spectrum sensing capability, that is, equipped with wide-band transceivers. Sensor nodes inside the WSSN can be installed in two different setups: (i) a single sensor per location, where only a single sensing node is deployed to sense spectral holes in its coverage area; (ii) multiple sensors per location, where multiple sensors can sense spectral holes for the same coverage area. Sensor nodes inside the WSSN network communicate on a common control channel of the assumed wireless sensor network technology. A coordinator of the WSSN serving as the fusion center (FC) is adopted to collect results from the sensing nodes, and it maintains the records in a table, termed the information table (IT) in this work. After obtaining data from all sensor nodes, the FC updates its IT and hence is up-to-date with all geographical locations at any instant. The FC is responsible for providing spectrum availability to the SU of the CRN. Moreover, the sensor nodes use the most popular energy detection [8] model for spectrum sensing because it is easy to implement and requires no prior knowledge about the primary signal(1)
H
0
:
y
t
=
n
t
,
H
1
:
y
t
=
h
x
t
+
n
t
,where x
(
t
) is the PU signal to be detected at the sensor node transceiver, n
(
t
) is AWGN, and h is the channel gain from the PU transmitter to the sensing node receiver. H
0 is the null hypothesis that there is no primary signal in the licensed band, while H
1 supports the existence of a PU signal. The energy detection can be defined as the average energy of N observed samples and is given by (2)
Y
=
1
N
∑
t
=
1
N
‍
y
t
2
.The decision as to whether the spectrum is occupied by the PU is made locally by each sensor by comparing the measurement with the predetermined threshold.


## 2.2. Frame Structure and Hybrid Nature

The proposed system combines good features of centralized and distributed spectrum access schemes and is therefore a hybrid system. Unlike the aforementioned CSA and the similar DSA, the proposed hybrid scheme is an infrastructure-less ad hoc wireless sensor network. The frame structure of the proposed hybrid system is similar to CSA, as shown in Figure4, where sensing and transmission are performed in parallel for a complete frame duration T. The significance of this frame structure is that sensing and transmission times are simultaneously increased. The increased spectrum sensing time results in the following:(1)
an improved detection probability that ensures better protection of the PU from harmful interference;
(2)
a reduced false alarm probability that increases spectrum utilization, improving the achievable throughput;
(3)
the optimization of sensing time, and the sensing time-throughput trade-off problem is overwhelmed.Figure 4
Frame structure of the proposed WSSN-assisted CRN.On the other hand, unlike the DSA technique, the proposed WSSN scheme eliminates the sensing time slot from the conventional frame structure, which is the better half of CSA. The advantage of eliminating the sensing slot from the conventional frame structure is that now this slot is also used for data transmission, which maximizes the achievable throughput. Cognitive users only request the FC for the spectrum when it needs to transmit data.


## 2.3. SU-WSSN Handshake Algorithm

When an SU needs to transmit data, it will contact the FC directly. If the FC is not accessible to the SU, sensor nodes have the ability to route its request to the FC. Note that sensor nodes can only route the channel request and channel grant message but cannot grant the channel to the SU based on their own decision. We assume a separate control channel for the WSSN-SU communication. The channel allocation algorithm is carried out through the following steps.(1)
The SU broadcasts a channel request ch_req packet on a separate control channel and starts its timer. The FC receives the request from the SU directly; if the FC is not in the SUs range, the nearby sensor node redirects the ch_req packet to the FC. The described packet contains the SU transmitter location, the SU receiver location, the maximum transmit power, and the maximum amount of data to be sent over the primary channel. The FC discards multiple copies of one request.
(2)
Upon receiving the ch_req packet, the FC examines the IT table measurements.
(3)
Based on IT table measurements, two cases can occur.
(a)
If the spectrum is available, the FC sends the channel grant ch_grt packet to the SU. The described packet contains information about the available spectrum, its bandwidth, the maximum data-rate, and the maximum allowable transmission power.
(b)
If the spectrum is not available, the FC sends the channel reject ch_rjt packet to the SU.
(4)
Upon receiving the ch_grt packet, the SU acknowledges the FC by transmittingack packet and starts data transmission on the allocated channel. In the second case, after time-out, the SU again requests the channel.
(5)
When the PU starts transmission on the primary channel, the FC sends a channel stop ch_stp packet to the SU in order to ensure the QoS of the PU. It also updates the SU with the new available spectrum for smooth and quick channel mobility.


## 2.4. Modified Cognition Cycle

As shown in Figure5, the architecture of the cognition cycle given in [9] is modified according to the proposed scheme. Compared to the traditional cognition cycle, the sensing part is moved outside of the traditional cognition cycle. Spectrum sensing is the responsibility of the dedicated WSSN network. The dedicated WSSN network will decide the spectrum band, the channel bandwidth, the maximum data rate, and the maximum allowable transmission power. Further, if the PU starts transmission on the specified spectrum, the FC can stop the SUs transmission. In other words, cognitive terminal complexity has been lowered by eliminating the sensing portion from the SUs architecture.Figure 5
Modified cognition cycle. The spectrum is analyzed by WSSN. The FC provides spectrum information that is used by the CRN to adapt to new parameters shown by the dotted lines.


## 2.5. Spectrum Mobility

Spectrum mobility [10] refers to the spectrum change made by a cognitive user when a PU starts data transmission on its licensed band. The purpose of spectrum mobility is to guarantee smooth and fast channel changeover, resulting in minimum performance degradation. The important prerequisite of spectrum mobility is information regarding the available spectral holes and the time duration required for smooth channel transitions. The availability of the spectrum ensures in-time and fast transitions in spectrum mobility. Zhu et al. [11] show through Markov chain analysis that the channel reservation and spectrum handoff significantly increase the throughput of cognitive users. In a performance evaluation, they present that the channel reservation reduces the force termination probability with a small increase in the blocking probability. In the proposed WSSN-assisted CRN system, the FC provides SUs with the backup reserved spectrum information based on its IT measurements. Thus, having the spectrum information, ongoing communication can be well-preserved with minimum performance degradation and enhanced throughput. Moreover, Park et al. in [12] present a stochastic model for a cognitive radio sensor network. In their work, they claim that the probability of force termination and the probability of blocking are both considerably decreased while the throughput has been enhanced by the channel reservation and spectrum mobility. The optimum number of reserved channels and system modeling based on the Markov chain are beyond the scope of this work.


## 2.6. Hidden and Exposed Terminal Problems

The hidden terminal problem [13] refers to the scenario in which PU transmission is occurring and is mistakenly inferred as a spectral hole. Consider the case, as shown in Figure 6(a), in which the PU transmitter transmits data to the PU receiver. If the SU is equipped with sensing capability, it is still unable to detect the PU transmitter, due to the hidden terminal problem. In the proposed scheme, the SU will request the FC of the WSSN network for the spectrum. The sensing network consists of several nodes that continuously sense the spectrum and update the FC accordingly. If there is a PU transmitter, the FC is aware of its existence, even in the situation in which the SU cannot sense the PU, as shown in Figure 6(a). Hence, by deploying WSSN nodes, the hidden terminal problem is solved without any additional sensing arrangement.Figure 6
Terminal problems.
(a)
Solving the hidden terminal problem. The primary transmitter is transmitting and is hidden to the secondary transmitter conventionally. In the proposed scheme, secondary users access the spectrum with the FCs approval. For the FC, the primary transmitter is not a hidden terminal
(b)
Solving the exposed terminal problem. The FC, knowing the location information, grants the spectrum to the SUOn the other hand, the exposed terminal problem [4] is considered a missed opportunity and is defined as the situation in which the spectrum is available but is mistakenly sensed as being occupied by the PU. Consider the scenario, as shown in Figure 6(b), in which the PU transmitter is transmitting data to the PU receiver. Here, the PU transmitter is near to the SU transmitter, while PU receiver is far away from the SU transmitter. In addition, the SU receiver is at the other side relative to the PU transmitter and receiver, as shown in the figure. Hence, in this case, the SU transmitter can transmit to the SU receiver without interfering with the primary network. However, due to a position dilemma, the SU transmitter senses that the primary network is occupied, resulting in a missed opportunity. In the proposed scheme, the IT table of the FC possesses the location information. Hence, the missed opportunity due to the exposed terminal problem is solved by the dedicated WSSN network with no additional setup required.


## 3. Throughput Analysis

This section demonstrates the throughput analysis of the proposed WSSN-assisted hybrid CRN and compares it with the throughput of the traditional CRN that works on the conventional packet frame, as shown in Figure1. Here, our main objective is to achieve a higher throughput than the conventional frame structure-based CRN network. A high detection probability is considered in order to protect PUs against harmful interference, maintaining the QoS of the licensed network.


### 3.1. Sensing Preliminaries

As aforementioned, the most popular spectrum sensing scheme, that is, energy detection [14], has been considered to determine the spectral hole for the proposed system. Our throughput analysis is based on the work specified in [7] that aims to find the optimal sensing time in the sensing-throughput trade-off. In our analysis, we have considered two cases for the proposed WSSN sensing scheme: (i) a single sensor per location; (ii) multiple sensors per location.


#### 3.1.1. A Single Sensor per Location

In this case, only one sensor is installed per unit geographical location to sense its spectral environment and report to the FC. Starting with (1), let τ be the sensing time and ϵ the detection threshold; Y as given in (2) is a random variable, which follows Chi-square distribution. For H
0, that is, the PU not transmitting, the probability density function (pdf) of Y is given by p
o
(
x
). The probability of false alarms P
f (i.e., the PU is available but wrongly detected) is given by (3)
P
f
=
P
Y
>
ϵ
∣
H
0
=
∫
ϵ
∞
‍
p
0
x
d
x
.Considering the circularly symmetric complex Gaussian (CSCG) noise, P
f is given by(4)
P
f
=
Q
ϵ
σ
u
2
-
1
τ
f
s
,where σ
μ
2 is the mean value of the pdf of Y, f
s is the sampling frequency, and Q
(
·
) is the complementary distribution function of the standard Gaussian given by (5)
Q
x
=
1
2
π
∫
x
∞
‍
e
x
p
t
2
2
d
t
.For a target probability of false alarms P
-
f, the detection threshold ϵ can be calculated as(6)
ϵ
=
σ
u
2
Q
-
1
P
-
f
τ
f
s
+
1
.On the other hand, for the case of H
1, that is, the PU in an active state, the pdf of Y is p
1
(
x
). With the given detection threshold ϵ, detection probability P
d is(7)
P
d
=
P
Y
>
ϵ
∣
H
1
=
∫
ϵ
∞
‍
p
1
x
d
x
.For the complex PSK and CSCG, P
d can be approximated as(8)
P
d
=
Q
ϵ
σ
u
2
-
γ
-
1
τ
f
s
2
γ
+
1
.The mean value of pdf of Y is (
γ
+
1
)
σ
μ
2 where γ is the received signal to noise ratio (SNR) from the PU at the detector receiver. For a target probability of detection P
-
d, the detection threshold ϵ can be determined as(9)
ϵ
=
σ
u
2
2
γ
+
1
τ
f
s
Q
-
1
P
-
d
+
γ
+
1
.From (4) and (8), the P
f for given target P
-
d and the P
d for given target P
-
f are as follows:(10)
P
f
=
Q
2
γ
+
1
Q
-
1
P
-
d
+
τ
f
s
γ
,
P
d
=
Q
1
2
γ
+
1
Q
-
1
P
-
f
-
τ
f
s
γ
.


#### 3.1.2. Multiple Sensors per Location

Here we are interested in the case in which multiple sensors are deployed per unit geographical location to sense the spectrum. LetK be the maximum number of sensors per unit location, τ
i the sensing time for sensor i, and ϵ the detection threshold. Equations (1) can be reconsidered for the multiple sensors case as(11)
H
0
:
y
i
t
=
n
i
t
,
H
1
:
y
i
t
=
h
i
x
i
t
+
n
i
t
,where noise n
i
(
t
) is independent for all K sensing nodes and the channel gain from the PU transmitter to the i
t
h sensing node h
i is the zero mean, unit variance complex Gaussian random variable. Each sensor makes individual decisions locally, while final decisions are made by the FC by fusing data from all K sensors.The probability of false alarmsP
f
i and the probability of detection P
d
i are the related probability measurements at sensing node i. Using the same mathematics as used for the single sensor case, these probabilities can be derived as follows:(12)
P
f
i
=
Q
ϵ
σ
u
i
2
-
1
τ
i
f
s
,
P
d
i
=
Q
ϵ
σ
u
i
2
-
γ
i
-
1
τ
i
f
s
2
γ
i
+
1
.Once each sensor makes a local decision on the presence of a PU, different rules can be used to make a final decision. According to the Logic AND rule, if all K decisions indicate that there is a PU, only then does the final decision announce that there is a PU; otherwise, there is no PU. Assuming independent decisions, the probability of false alarms and the probability of detection are as follows:(13)
P
f
=
∏
i
=
1
K
‍
P
f
i
,
P
d
=
∏
i
=
1
K
‍
P
d
i
.The logic OR rule indicates that if one of the sensing nodes shows that there is a PU, the final decision declares the PUs existence; otherwise there is no PU. Assuming independent decisions, the probability of false alarms and the probability of detection are as follows:(14)
P
f
=
1
-
∏
i
=
1
K
‍
1
-
P
f
i
,
P
d
=
1
-
∏
i
=
1
K
‍
1
-
P
d
i
.


### 3.2. Throughput Calculations

After deriving the relationship between the probability of false alarms and the probability of detection, now we are able to compute the throughput of the secondary network based on the derived equations. As mentioned before, the conventional frame consists of a sensing slot and a transmission slot, as shown in Figure1. The sensing time is denoted by τ, while the total frame duration is T. Note that, in the proposed scheme, the sensing time is zero from the SUs viewpoint, as the SU is not involved in spectrum sensing. The spectrum sensing task is the responsibility of the dedicated WSSN network. Moreover, the value of τ varies from 0 to T as the proposed dedicated network senses the spectrum maximum to the frame duration.In the proposed scheme,τ
=
0 wrt SU viewpoint,
0
<
τ
≤
T wrt dedicated network.The throughput of the secondary network when it operates in the absence of a PU is denoted by C
0, while that in the presence of a PU is given by C
1. Consider the case in which there is only one point-to-point transmission among the SU users, as studied in [7], then S
N
R
s is the received SNR for the cognitive network at the SU receiver. S
N
R
p illustrates the received SNR from the PU at the SU receiver:(15)
C
0
=
l
o
g
2
1
+
S
N
R
s
,
C
1
=
l
o
g
2
1
+
S
N
R
s
1
+
S
N
R
p
.For a given spectrum of concern, P
[
H
0
] is the probability when the PU is quiet. On the other hand, P
[
H
1
] is defined as the probability when the PU is active on the specified spectrum. Now the SU can use the licensed band in the following two approaches.Case 1.
When the PU is inactive and no false alarm is produced, then the achievable throughput of the CRN is calculated asT
-
τ
/
T
C
0. The probability of this condition occurring is (
1
-
P
f
)
P
[
H
0
]. Therefore, the average throughput for this case is R
0:(16)
R
0
=
T
-
τ
T
C
0
1
-
P
f
P
H
0
.When the PU is using the specific spectrum but wrongly not detected, then the achievable throughput of the CRN is calculated as T
-
τ
/
T
C
1. The probability of this condition occurring is (
1
-
P
d
)
P
[
H
1
]. Therefore, the average throughput for this case is R
1:(17)
R
1
=
T
-
τ
T
C
1
1
-
P
d
P
H
1
.The overall average throughput of the traditional frame-based CRN is defined by R and is determined as(18)
R
=
R
0
+
R
1
=
T
-
τ
T
C
0
1
-
P
f
P
H
0
+
T
-
τ
T
C
1
1
-
P
d
P
H
1
.As stated earlier, in the proposed scheme, τ
=
0 from the SUs standpoint, as the SU is not involved in the spectrum sensing itself. Hence (16) and (17) result in the following modified equations for average throughputs R
^
0 and R
^
1:(19)
R
^
0
=
C
0
1
-
P
f
P
H
0
,
R
^
1
=
C
1
1
-
P
d
P
H
1
.The overall average throughput of the CRN for the proposed WSSN scheme is R
^: (20)
R
^
=
R
^
0
+
R
^
1
=
C
0
1
-
P
f
P
H
0
+
C
1
1
-
P
d
P
H
1
.
By comparing (18) and (20), it is validated that the throughput of the proposed WSSN-assisted CRN is greater than the traditional frame-based CRN network(21)
R
^
>
R
.Moreover, in the proposed technique, the sensing time is 0
<
τ
≤
T from a dedicated network perspective. It is known from [15] that, for a target false alarm probability P
-
f, an increase in the sensing time maximizes probability of detection P
d. P
^
d is defined as the detection probability with maximum sensing time T and is determined by(22)
P
^
d
=
Q
1
2
γ
+
1
Q
-
1
P
-
f
-
T
f
s
γ
.As Q
(
x
) is a decreasing function of x, it is proven that P
^
d
≥
P
d.
Similarly, for a target detection probabilityP
-
d, an increase in the sensing time results in a reduced probability of false alarm P
f. P
^
f is defined as the probability of false alarms with maximum sensing time T and is determined by(23)
P
^
f
=
Q
2
γ
+
1
Q
-
1
P
-
d
+
T
f
s
γ
.As Q
(
x
) is a decreasing function of x, hence P
^
f
≤
P
f.
For maximum sensing timeτ
=
T, the average throughput of the CRN for the proposed WSSN scheme is determined by R
-:(24)
R
-
=
C
0
1
-
P
^
f
P
H
0
+
C
1
1
-
P
^
d
P
H
1
.Comparing (20) and (24), the throughput of WSSN-assisted CRN using maximum sensing time τ
=
T is greater than the throughput of the WSSN-assisted CRN at τ
<
T. This is because, at sensing time τ
=
T, P
d has its highest value P
^
d, while P
f has its lowest value P
^
f
(25)
R
-
>
R
^
.Combining (21) and (25), it can be concluded in the throughput analysis that the average throughput R
- of the WSSN-assisted CRN using maximum sensing time T is greater than the average throughput R
^ using sensing time of 0
<
τ
≤
T, which is, in turn, greater than the throughput R of the conventional frame-based CRN. This statement is concluded by the following equation:(26)
R
-
>
R
^
>
R
.


## 3.1. Sensing Preliminaries

As aforementioned, the most popular spectrum sensing scheme, that is, energy detection [14], has been considered to determine the spectral hole for the proposed system. Our throughput analysis is based on the work specified in [7] that aims to find the optimal sensing time in the sensing-throughput trade-off. In our analysis, we have considered two cases for the proposed WSSN sensing scheme: (i) a single sensor per location; (ii) multiple sensors per location.


### 3.1.1. A Single Sensor per Location

In this case, only one sensor is installed per unit geographical location to sense its spectral environment and report to the FC. Starting with (1), let τ be the sensing time and ϵ the detection threshold; Y as given in (2) is a random variable, which follows Chi-square distribution. For H
0, that is, the PU not transmitting, the probability density function (pdf) of Y is given by p
o
(
x
). The probability of false alarms P
f (i.e., the PU is available but wrongly detected) is given by (3)
P
f
=
P
Y
>
ϵ
∣
H
0
=
∫
ϵ
∞
‍
p
0
x
d
x
.Considering the circularly symmetric complex Gaussian (CSCG) noise, P
f is given by(4)
P
f
=
Q
ϵ
σ
u
2
-
1
τ
f
s
,where σ
μ
2 is the mean value of the pdf of Y, f
s is the sampling frequency, and Q
(
·
) is the complementary distribution function of the standard Gaussian given by (5)
Q
x
=
1
2
π
∫
x
∞
‍
e
x
p
t
2
2
d
t
.For a target probability of false alarms P
-
f, the detection threshold ϵ can be calculated as(6)
ϵ
=
σ
u
2
Q
-
1
P
-
f
τ
f
s
+
1
.On the other hand, for the case of H
1, that is, the PU in an active state, the pdf of Y is p
1
(
x
). With the given detection threshold ϵ, detection probability P
d is(7)
P
d
=
P
Y
>
ϵ
∣
H
1
=
∫
ϵ
∞
‍
p
1
x
d
x
.For the complex PSK and CSCG, P
d can be approximated as(8)
P
d
=
Q
ϵ
σ
u
2
-
γ
-
1
τ
f
s
2
γ
+
1
.The mean value of pdf of Y is (
γ
+
1
)
σ
μ
2 where γ is the received signal to noise ratio (SNR) from the PU at the detector receiver. For a target probability of detection P
-
d, the detection threshold ϵ can be determined as(9)
ϵ
=
σ
u
2
2
γ
+
1
τ
f
s
Q
-
1
P
-
d
+
γ
+
1
.From (4) and (8), the P
f for given target P
-
d and the P
d for given target P
-
f are as follows:(10)
P
f
=
Q
2
γ
+
1
Q
-
1
P
-
d
+
τ
f
s
γ
,
P
d
=
Q
1
2
γ
+
1
Q
-
1
P
-
f
-
τ
f
s
γ
.


### 3.1.2. Multiple Sensors per Location

Here we are interested in the case in which multiple sensors are deployed per unit geographical location to sense the spectrum. LetK be the maximum number of sensors per unit location, τ
i the sensing time for sensor i, and ϵ the detection threshold. Equations (1) can be reconsidered for the multiple sensors case as(11)
H
0
:
y
i
t
=
n
i
t
,
H
1
:
y
i
t
=
h
i
x
i
t
+
n
i
t
,where noise n
i
(
t
) is independent for all K sensing nodes and the channel gain from the PU transmitter to the i
t
h sensing node h
i is the zero mean, unit variance complex Gaussian random variable. Each sensor makes individual decisions locally, while final decisions are made by the FC by fusing data from all K sensors.The probability of false alarmsP
f
i and the probability of detection P
d
i are the related probability measurements at sensing node i. Using the same mathematics as used for the single sensor case, these probabilities can be derived as follows:(12)
P
f
i
=
Q
ϵ
σ
u
i
2
-
1
τ
i
f
s
,
P
d
i
=
Q
ϵ
σ
u
i
2
-
γ
i
-
1
τ
i
f
s
2
γ
i
+
1
.Once each sensor makes a local decision on the presence of a PU, different rules can be used to make a final decision. According to the Logic AND rule, if all K decisions indicate that there is a PU, only then does the final decision announce that there is a PU; otherwise, there is no PU. Assuming independent decisions, the probability of false alarms and the probability of detection are as follows:(13)
P
f
=
∏
i
=
1
K
‍
P
f
i
,
P
d
=
∏
i
=
1
K
‍
P
d
i
.The logic OR rule indicates that if one of the sensing nodes shows that there is a PU, the final decision declares the PUs existence; otherwise there is no PU. Assuming independent decisions, the probability of false alarms and the probability of detection are as follows:(14)
P
f
=
1
-
∏
i
=
1
K
‍
1
-
P
f
i
,
P
d
=
1
-
∏
i
=
1
K
‍
1
-
P
d
i
.


## 3.1.1. A Single Sensor per Location

In this case, only one sensor is installed per unit geographical location to sense its spectral environment and report to the FC. Starting with (1), let τ be the sensing time and ϵ the detection threshold; Y as given in (2) is a random variable, which follows Chi-square distribution. For H
0, that is, the PU not transmitting, the probability density function (pdf) of Y is given by p
o
(
x
). The probability of false alarms P
f (i.e., the PU is available but wrongly detected) is given by (3)
P
f
=
P
Y
>
ϵ
∣
H
0
=
∫
ϵ
∞
‍
p
0
x
d
x
.Considering the circularly symmetric complex Gaussian (CSCG) noise, P
f is given by(4)
P
f
=
Q
ϵ
σ
u
2
-
1
τ
f
s
,where σ
μ
2 is the mean value of the pdf of Y, f
s is the sampling frequency, and Q
(
·
) is the complementary distribution function of the standard Gaussian given by (5)
Q
x
=
1
2
π
∫
x
∞
‍
e
x
p
t
2
2
d
t
.For a target probability of false alarms P
-
f, the detection threshold ϵ can be calculated as(6)
ϵ
=
σ
u
2
Q
-
1
P
-
f
τ
f
s
+
1
.On the other hand, for the case of H
1, that is, the PU in an active state, the pdf of Y is p
1
(
x
). With the given detection threshold ϵ, detection probability P
d is(7)
P
d
=
P
Y
>
ϵ
∣
H
1
=
∫
ϵ
∞
‍
p
1
x
d
x
.For the complex PSK and CSCG, P
d can be approximated as(8)
P
d
=
Q
ϵ
σ
u
2
-
γ
-
1
τ
f
s
2
γ
+
1
.The mean value of pdf of Y is (
γ
+
1
)
σ
μ
2 where γ is the received signal to noise ratio (SNR) from the PU at the detector receiver. For a target probability of detection P
-
d, the detection threshold ϵ can be determined as(9)
ϵ
=
σ
u
2
2
γ
+
1
τ
f
s
Q
-
1
P
-
d
+
γ
+
1
.From (4) and (8), the P
f for given target P
-
d and the P
d for given target P
-
f are as follows:(10)
P
f
=
Q
2
γ
+
1
Q
-
1
P
-
d
+
τ
f
s
γ
,
P
d
=
Q
1
2
γ
+
1
Q
-
1
P
-
f
-
τ
f
s
γ
.


## 3.1.2. Multiple Sensors per Location

Here we are interested in the case in which multiple sensors are deployed per unit geographical location to sense the spectrum. LetK be the maximum number of sensors per unit location, τ
i the sensing time for sensor i, and ϵ the detection threshold. Equations (1) can be reconsidered for the multiple sensors case as(11)
H
0
:
y
i
t
=
n
i
t
,
H
1
:
y
i
t
=
h
i
x
i
t
+
n
i
t
,where noise n
i
(
t
) is independent for all K sensing nodes and the channel gain from the PU transmitter to the i
t
h sensing node h
i is the zero mean, unit variance complex Gaussian random variable. Each sensor makes individual decisions locally, while final decisions are made by the FC by fusing data from all K sensors.The probability of false alarmsP
f
i and the probability of detection P
d
i are the related probability measurements at sensing node i. Using the same mathematics as used for the single sensor case, these probabilities can be derived as follows:(12)
P
f
i
=
Q
ϵ
σ
u
i
2
-
1
τ
i
f
s
,
P
d
i
=
Q
ϵ
σ
u
i
2
-
γ
i
-
1
τ
i
f
s
2
γ
i
+
1
.Once each sensor makes a local decision on the presence of a PU, different rules can be used to make a final decision. According to the Logic AND rule, if all K decisions indicate that there is a PU, only then does the final decision announce that there is a PU; otherwise, there is no PU. Assuming independent decisions, the probability of false alarms and the probability of detection are as follows:(13)
P
f
=
∏
i
=
1
K
‍
P
f
i
,
P
d
=
∏
i
=
1
K
‍
P
d
i
.The logic OR rule indicates that if one of the sensing nodes shows that there is a PU, the final decision declares the PUs existence; otherwise there is no PU. Assuming independent decisions, the probability of false alarms and the probability of detection are as follows:(14)
P
f
=
1
-
∏
i
=
1
K
‍
1
-
P
f
i
,
P
d
=
1
-
∏
i
=
1
K
‍
1
-
P
d
i
.


## 3.2. Throughput Calculations

After deriving the relationship between the probability of false alarms and the probability of detection, now we are able to compute the throughput of the secondary network based on the derived equations. As mentioned before, the conventional frame consists of a sensing slot and a transmission slot, as shown in Figure1. The sensing time is denoted by τ, while the total frame duration is T. Note that, in the proposed scheme, the sensing time is zero from the SUs viewpoint, as the SU is not involved in spectrum sensing. The spectrum sensing task is the responsibility of the dedicated WSSN network. Moreover, the value of τ varies from 0 to T as the proposed dedicated network senses the spectrum maximum to the frame duration.In the proposed scheme,τ
=
0 wrt SU viewpoint,
0
<
τ
≤
T wrt dedicated network.The throughput of the secondary network when it operates in the absence of a PU is denoted by C
0, while that in the presence of a PU is given by C
1. Consider the case in which there is only one point-to-point transmission among the SU users, as studied in [7], then S
N
R
s is the received SNR for the cognitive network at the SU receiver. S
N
R
p illustrates the received SNR from the PU at the SU receiver:(15)
C
0
=
l
o
g
2
1
+
S
N
R
s
,
C
1
=
l
o
g
2
1
+
S
N
R
s
1
+
S
N
R
p
.For a given spectrum of concern, P
[
H
0
] is the probability when the PU is quiet. On the other hand, P
[
H
1
] is defined as the probability when the PU is active on the specified spectrum. Now the SU can use the licensed band in the following two approaches.Case 1.
When the PU is inactive and no false alarm is produced, then the achievable throughput of the CRN is calculated asT
-
τ
/
T
C
0. The probability of this condition occurring is (
1
-
P
f
)
P
[
H
0
]. Therefore, the average throughput for this case is R
0:(16)
R
0
=
T
-
τ
T
C
0
1
-
P
f
P
H
0
.When the PU is using the specific spectrum but wrongly not detected, then the achievable throughput of the CRN is calculated as T
-
τ
/
T
C
1. The probability of this condition occurring is (
1
-
P
d
)
P
[
H
1
]. Therefore, the average throughput for this case is R
1:(17)
R
1
=
T
-
τ
T
C
1
1
-
P
d
P
H
1
.The overall average throughput of the traditional frame-based CRN is defined by R and is determined as(18)
R
=
R
0
+
R
1
=
T
-
τ
T
C
0
1
-
P
f
P
H
0
+
T
-
τ
T
C
1
1
-
P
d
P
H
1
.As stated earlier, in the proposed scheme, τ
=
0 from the SUs standpoint, as the SU is not involved in the spectrum sensing itself. Hence (16) and (17) result in the following modified equations for average throughputs R
^
0 and R
^
1:(19)
R
^
0
=
C
0
1
-
P
f
P
H
0
,
R
^
1
=
C
1
1
-
P
d
P
H
1
.The overall average throughput of the CRN for the proposed WSSN scheme is R
^: (20)
R
^
=
R
^
0
+
R
^
1
=
C
0
1
-
P
f
P
H
0
+
C
1
1
-
P
d
P
H
1
.
By comparing (18) and (20), it is validated that the throughput of the proposed WSSN-assisted CRN is greater than the traditional frame-based CRN network(21)
R
^
>
R
.Moreover, in the proposed technique, the sensing time is 0
<
τ
≤
T from a dedicated network perspective. It is known from [15] that, for a target false alarm probability P
-
f, an increase in the sensing time maximizes probability of detection P
d. P
^
d is defined as the detection probability with maximum sensing time T and is determined by(22)
P
^
d
=
Q
1
2
γ
+
1
Q
-
1
P
-
f
-
T
f
s
γ
.As Q
(
x
) is a decreasing function of x, it is proven that P
^
d
≥
P
d.
Similarly, for a target detection probabilityP
-
d, an increase in the sensing time results in a reduced probability of false alarm P
f. P
^
f is defined as the probability of false alarms with maximum sensing time T and is determined by(23)
P
^
f
=
Q
2
γ
+
1
Q
-
1
P
-
d
+
T
f
s
γ
.As Q
(
x
) is a decreasing function of x, hence P
^
f
≤
P
f.
For maximum sensing timeτ
=
T, the average throughput of the CRN for the proposed WSSN scheme is determined by R
-:(24)
R
-
=
C
0
1
-
P
^
f
P
H
0
+
C
1
1
-
P
^
d
P
H
1
.Comparing (20) and (24), the throughput of WSSN-assisted CRN using maximum sensing time τ
=
T is greater than the throughput of the WSSN-assisted CRN at τ
<
T. This is because, at sensing time τ
=
T, P
d has its highest value P
^
d, while P
f has its lowest value P
^
f
(25)
R
-
>
R
^
.Combining (21) and (25), it can be concluded in the throughput analysis that the average throughput R
- of the WSSN-assisted CRN using maximum sensing time T is greater than the average throughput R
^ using sensing time of 0
<
τ
≤
T, which is, in turn, greater than the throughput R of the conventional frame-based CRN. This statement is concluded by the following equation:(26)
R
-
>
R
^
>
R
.


## 4. Simulation Results

In this section, the simulation results are presented to demonstrate the surge in throughput of the proposed WSSN-assisted cognitive network. The PU is assumed to be a QPSK-modulated signal with a 6 MHz bandwidth. We choose the frame durationT
=
5
0 ms while sampling frequency f
s is set to 6 MHz. The channel is assumed to follow the Rayleigh fading model where the additive noise is a zero-mean CSCG process. The probability that primary signal is not present in the band, that is P
[
H
0
] is selected to be 0.7 and the probability that primary signal exists in the band, that is P
[
H
1
] is selected to be 0.3. Moreover, a high target detection probability, that is P
d
=
0.95 is considered for PU protection.First, we compare the probability of false alarms as a function of sensing timeτ for single sensor per location and multiple sensors per location cases. Figure 7 shows that, for a given sensing time, increasing the number of sensors per unit location decreases the probability of false alarms, improving the performance of spectrum sensing and enhancing the achievable throughput of the cognitive network.Figure 7
Probability of false alarm for single sensor and multiple sensors per location cases versus sensing timeτ.Next, we suppose that the SNR for cognitive userS
N
R
s
=
20 dB, and choose SNR from the primary transmitter S
N
R
p
=
-
20 dB. Figure 8 shows the achievable throughput versus the sensing time for the cognitive network. In this figure, the throughputs of the two cases are compared: (i) throughput R
- of the proposed WSSN-assisted cognitive network when it takes maximum sensing time T; (ii) throughput R of the conventional frame-based CRN considering the optimal sensing time. It is clear from the figure that R
- is independent of the sensing time and is significantly higher than R, which illustrates the throughput maximization of the cognitive network through the proposed WSSN scheme compared to the conventional frame-based CRN. This independence can be explained by the fact that the SU is free from sensing overhead and whole frame duration T is used for data transmission. On the other hand, in the conventional frame-based CRN, only a part of the total frame was used for data transmission while the other portion of the total frame was expended carelessly in spectrum sensing burden. Figure 9 illustrates the normalized throughput for the cognitive network, defined as (
1
-
P
f
)
(
1
-
τ
/
T
). This figure also reveals that the throughput of WSSN-assisted CRN is significantly higher than that of the conventional frame-based CRN.Figure 8
Achievble throughput of a proposed and conventional scheme versus sensing timeτ.Figure 9
Normalized throughput of a proposed and conventional scheme versus sensing timeτ.In Figure10, we show the achievable throughput versus target detection probability for the proposed and conventional schemes where S
N
R
p is fixed at −20 dB. The curves in the figure reveal that the achievable throughput of the proposed scheme is significantly higher than the throughput of the conventional CRN. This figure also demonstrates that, as the target probability reaches a higher value, the throughput decreases, showing the PUs better protection from harmful interference. Further, Figure 11 also illustrates that the achievable throughput of the proposed WSSN-assisted CRN is considerably higher than the conventional frame-based CRN for different values of S
N
R
p considering a high detection probability.Figure 10
Achievble throughput of a proposed and conventional scheme versus target detection probabilityP
-
d.Figure 11
Achievble throughput of a proposed and conventional scheme versus primary SNRS
N
R
p.


## 5. Conclusion

In this paper, we have proposed a dedicated WSSN network that separates the sensing task from SUs of a CRN. The dedicated sensing network detects the spectral hole in the primary network and provides admission control for the secondary users. The proposed scheme significantly improves the achievable throughput by minimizing the sensing time to zero from secondary users perspective. Alternatively, the sensing time for spectrum detection has been increased by deploying a separate sensor network. Using an energy detection scheme in the sensing network, we have analyzed a high detection probability and a lower false alarm probability. The given analysis clearly indicates that a high probability of detection prevents secondary users harmful interference to the primary network, while a lower probability of false alarm ensures better utilization of the primary spectrum by secondary users. The simulation results reveal that the proposed technique significantly increases the achievable throughput compared to the conventional frame-based CRN. In addition, the proposed scheme solves the hidden and exposed terminal problem without extra setup and also gives an optimal solution to the spectrum mobility problem. Finally, the proposed schemes’ effectiveness is demonstrated through simulation results.



---

*Source: 195794-2015-06-22.xml*