ReView by River Valley Technologies IET Circuits, Devices Systems

IET Circuits, Devices &

Systems

Neuro-fuzzy based Two-Stage Spectrum

Allocation Scheme to Ensure Spectrum Efficiency
in CRN-CSS Assisted by Spectrum Agent
CDS-2018-5128.R2 | Research Article

Submitted on: 22-01-2019

Submitted by: Giri Prasad R, Venkatesan P

Keywords: COGNITIVE RADIO, ARTIFICIAL NEURAL NETWORK, WIRELESS COMMUNICATION

2019/02/18 18:23:52 IET Review Copy Only 1

ReView by River Valley Technologies IET Circuits, Devices Systems

Neuro-fuzzy based Two-Stage Spectrum Allocation Scheme to Ensure Spectrum

Efficiency in CRN-CSS Assisted by Spectrum Agent

R. Giri Prasad*1, Dr. P. Venkatesan2

Research Scholar, Dept. of ECE, SCSVMV University Tamil Nadu, India
rgiriprasadscsvmv@gmail.com
Associate Professor Dept. of ECE, SCSVMV University, Tamil Nadu, India
venkatesan.p@kanchiuniv.ac.in
*Corresponding Author: R. Giri Prasad

Abstract: Cognitive Radio Network (CRN) is a promising technology to solve increasing spectrum scarcity problems in
recent time. This paper resolves problem of cooperative spectrum sensing (CSS) and spectrum allocation in CRN-CSS in
order to improve spectrum efficiency. Two-stage spectrum allocation scheme is initiated by grouping secondary users (SUs)
with the aware of one-hop neighbor approach which leads to minimized grouping time. These grouped SUs perform
spectrum sensing in cooperative manner. To avoid sensing interference between SUs, channel assignment process is
involved with Optimal Channel Assignment (OCA) strategy. OCA assigns channels to each SU in group in dynamic manner
and ensures that each channel is sensed by each SU in the group. Upon assigned channel, SU performs spectrum sensing
with aid of Enhanced Threshold Energy detection (ETED) method. Gain of using ETED method is accurate spectrum sensing
even in noise uncertainty scenario. Finally, the available spectrum is allocated to SUs by a novel two-stage allocation
approach. In this approach, SUs which provide accurate spectrum sensing result are rewarded with high priority for
spectrum allocation. These SUs are detected through global decision making at fusion center (FC). A novel mining tree
scheme with spectrum agent (SA) is adopted for decision making at FC. Involvement of neuro-fuzzy based spectrum
allocation (NFBSA) scheme in two-stage allocation support effective spectrum allocation. Extensive experimental result
exhibits the promising improvements in than the previous approaches

Keywords: cognitive radio, cooperative spectrum sensing, spectrum allocation, neuro-fuzzy.

I. Introduction group in CRN-CSS, a Time Division Multiple Access

Extensive development in wireless communication
probes numerous users towards it. However, spectrum
scarcity problem limits the usage of wireless spectrum in an
efficient manner [1]. On the other hand, spectrum is
underutilized by Primary Users (PUs) who are often called
as licensed users. Cognitive Radio (CR) solves this
spectrum scarcity problem by taking advantage of unused
PU spectrum [2]. Key functions involved in CRN are
spectrum sensing, spectrum decision making, and spectrum
allocation [3]. To support CSS, network is clustered [4], [5],
[6], divided into sectors, and grouped. In divided group,
sensing interference is major problem. To avoid sensing
interference and to support multichannel scenario, CRN-
CSS requires effective sensing scheduling and channel
assignment in order to sense in cooperative manner [7], [8].
Scheduling scheme in CRN-CSS results in throughput
improvement, energy efficiency, Quality of Service (QoS)
provisioning, and fairness consideration. Greedy algorithm,
dynamic programming, game theory approaches are
designed to schedule sensing channel for CSS. In clustered
CRN, coalitional game theoretic approach is employed to
resolve cooperative sensing scheduling in CSS. For each
(TDMA) based timeslot is assigned for spectrum sensing.
Multiple mini-slots sensing time is assigned for spectrum
sensing by improved energy detector method [9].
Spectrum sensing accuracy is improved by introducing
Cooperative Spectrum Sensing (CSS) concept in CRN [10],
[11]. In CRN-CSS, spectrum sensing is performed in a
cooperative manner, and each SU share their sensing report
with other SUs. Upon receiving each SU’s sensing report,
global decision is made in centralized node also known as
fusion center. Spectrum sensing is involved with various
sensing techniques such as matched filter method,
waveform detector, correlation detector, Cyclostationary
detector, Eigen value based detector, energy detector and so
on. In these techniques, energy detection method is utilized
widely due to its simplicity and flexibility [12]. To increase
efficiency of energy detector many researchers attempt to
improve ED method in CRN-CSS [13], [14]. Max-min SNR
method [15] applies Signal-to-Noise Ratio (SNR) value in
threshold detection for energy detection method whereas
kernel theory is adopted in Kernlized Energy Detector
(KED) method [16]. In blind ED method [17], Maximum-
Minimum Energy (MMEN) ratio is utilized. In decision
making at FC, various rules such as OR rule, AND rule

2019/02/18 18:23:52 IET Review Copy Only 2

ReView by River Valley Technologies
[18], majority rule [18] and maximal ratio combining rule,
k-out-of N rule [19] etc. are involved. Decision making is
performed with the aim of minimizing energy consumption
in CRN-CSS [20]. Based on spectrum sensing results,
spectrum availability is detected in CRN. The available
spectrum is shared among SUs which are participated in
CSS. Spectrum is allocated by Bee colony algorithm in
order to improve Quality of Experience [21]. Spectrum
allocation decision is made based on PU activity, network
states, SU diversity, and spectrum characteristics in Bee
colony algorithm. Probability Density Function (PDF) and
Cumulative Distribution Function (CDF) are considered for
spectrum allocation in the presence of spectrum holes [22].
Double auction which is a game theoretic approach also
involved in spectrum allocation in cluster based network.
Perhaps all above works improves CRN-CSS, spectrum
sensing and spectrum utilization are still major challenges
due to noisy channel environment and dynamic nature of
SUs respectively. Thus the major contributions of this work
in CRN-CSS are summarized as follows,
• Novel CRN-CSS architecture with Spectrum Agent is
designed to support accurate decision making and to
improve spectrum efficiency.
• Cooperative spectrum sensing is achieved by grouping
SUs based on one-hop neighbor approach. Grouping
based on one-hop neighbor minimizes time
consumption and energy consumption for grouping.
• Sensing interference is resolved by OCA strategy in
which each SU is assigned with channel for sensing at
each time slot. Due to the involvement of OCA strategy
each SU senses all channels in dynamic manner which
leads to high sensing efficiency.
• On assigned channel SU performs spectrum sensing by
ETED method in order to improve sensing accuracy.
ETED method tenacities the problem of sensing in
noise uncertainties.
• Finally spectrum allocation based on two-stage
allocation strategy involves with global decision
making and spectrum allocation. Global decision
making is ambitious by building mining tree for
aggregated SUs sensing results with SA’s sensing
result. Spectrum allocation is performed for efficient
SUs by NFBSA scheme which consider spectrum
efficiency, sensing power, and velocity in order to
ensure spectrum is allocated to optimal SUs.
The rest of this paper is organized as follows, Section II
surveys related works held on CRN-CSS. In section III,
define problems in previous research works on CRN-CSS.
Section IV explains proposed CRN-CSS architecture with
proposed algorithms. Section V deals with experimental
evaluation of proposed work. In section VI, we conclude
our contributions.
II. Related Works
2019/02/18 18:23:52 IET Review Copy Only
IET Circuits, Devices Systems
An improved version of k-means algorithm namely
diffusing-CRN k-means algorithm was adapted in CRN in
order to preserve cooperativeness among SUs [23].
Improved k-means algorithm was involved with eight steps
as follows: initialization, publication, update, confirm,
propagation, election, crowning, and allegiance. These eight
steps were performed sequentially for cluster formation.
Involvement of sequential steps increases clustering time.
However, due to mobility of SUs frequent clustering is
required in CRN. Hence this method results in high time
consumption for clustering which minimizes sensing time is
not decent for CRN. Virtual clustering scheme was
employed in CRN-CSS for distributed coordination [24].
Virtual clustering scheme was performed based on concept
that neighboring SU typically observe same spectrum
availability (i.e.) nearest neighboring nodes were detected
based on sensed spectrum availability. In cluster formation,
control packets such as coordination request, coordination
respond, coordination decision, and activated shared
channel were involved. Even for one-hop neighbor
clustering, virtual clustering scheme was suggested to
exchange all above control packets. Hereby it is clear that
control packet overhead is major problem in virtual
clustering scheme which is difficult to handle. Group based
CRN was involved with neighbor node detection phase,
node communication phase, and group formation phase in
CRN [25]. Group formation was initiated by an active node
at time instance and other active nodes were joined with
that group. Here active neighbor nodes were detect in
neighbor node detection phase. In the formed group, each
node maintain neighbor node table in order to avoid
collision in the network. It is noticeable that maintaining
neighbor node table with all neighbor details absolutely
results in high overhead.
In grouped CRN, sensing channel assignment was
carried out by adaptive assignment strategy which was
involved with channel selection then best user assignment
(CSBUA) algorithm and best user assignment then channel
selection (BUACS) algorithm [26]. Each group was
assigned with different channel and that group members
were responsible to sense the assigned channels. Spectrum
sensing was performed on assigned channel by energy
detection method. In adaptive assignment method, SU is
allowed to sense single channel in each round and wait until
next round for sensing. This waiting time for sensing
degrades the sensing efficiency. In utility based CRN-CSS,
sensing channel was assigned based on channel uncertainty
[27]. In utility based CRN-CSS, each SU was allowed to
made decision about spectrum sensing (i.e.) whether
participated in sensing or not. SUs which were participated
in sensing often called as contributors while other SUs were
known as free riders. Here some channels are left idle since
contributors select the channel for sensing. It also results in
ineffective spectrum sensing if the network contains number
of free riders more than contributors. Multi-slot energy
efficient spectrum sensing scheduling strategy was
3
ReView by River Valley Technologies
employed to minimize energy consumption [28]. SU
transmitter was responsible to decide whether perform
sensing or in idle stage in order to save energy. If a SU
decide to be in inactive stage then that SU was idle in
current time slot. This method leads to spectrum
underutilization if multiple SUs decided to in inactive state.
Upon assigned channel, spectrum sensing was performed by
modified energy detector method [29]. Working of
modified energy detector method was realized by Otsu’s
method. Otsu’s method was adapted in threshold detection
process in energy detector. Energy detector based spectrum
sensing was improved by including optimal data fusion
rules [30]. Here OR rule, AND rule K out of N rule were
incorporated for data fusion along with energy detection
method in CSS. Involvement of multiple computations in
Otsu’s method increases computational complexity of
energy detector method whereas ineffective data fusion
techniques lead to sensing efficiency degradation.
In selective cluster based CRN-CSS, Chair-Vashney
rule was incorporated for data fusion [31]. In this approach
CH selection was performed based on sensing data
reliability. Each cluster decision was controlled by a
threshold value which was detected by Neyman-Pearson
criterion. Here local spectrum sensing is involved with
conventional ED method which degrades sensing
performance in low SNR scenarios. Energy efficient
cooperative spectrum sensing was involved with OR rule
for data fusion [32]. Cooperative spectrum sensing was
formulated as scheduling problem and solved by assigning
channels based on detection and false alarm probabilities.
Each SU had to send the sensing report as binary vale. Here
OR rule has problem that PU absence decision made only if
all SU report the same. Otherwise PU presence decision is
made which leads to spectrum underutilization. In case of
PU absence, the next step is to allocate the available
spectrum to SUs. Dynamic spectrum allocation was
endorsed with the consideration of assignment power,
frequency, and antenna directionality of SU [33]. Then the
problem of resource allocation was optimized by convex
relaxation with three pruning (CRTP) algorithm, convex
relaxation with gradual removal (CRGR) algorithm, and
genetic algorithm (GA). Here each algorithm lies with
problem as CRTP results high performance with high
computation overhead while CRGR results in low
performance with low computation overhead. Capacity
aware spectrum allocation was formulated as binary integer
linear programming (BILP) and radix-tree was utilized for
spectrum allocation [34]. Here radix tree construction was
suggested in order to minimize time complexity by
removing sparse areas from search space. In this approach
only link quality is considered for resource allocation and
other optimal metrics are not considered.
III. Problem Definition
2019/02/18 18:23:52 IET Review Copy Only
IET Circuits, Devices Systems
In CRN-CSS, clustering of SUs was performed based on
sensing results [35]. Clustering process was comprised with
pruning stage, selecting stage, and clustering stage. In
pruning stage SUs with imperfect sensing report were
removed from the group. Selecting stage select an optimal
SU as cluster head (CH) based on reliability of sensing
result. Then the cluster was formed without some SUs
which were removed in pruning stage. In practical scenario,
spectrum sensing is affected by channel SNR, noise
uncertainty and other factors. So clustering based on
sensing reports is not well performed in practical scenario.
Also removing SUs in pruning stage leads to severe
performance degradation in spectrum sensing.
Followed by spectrum sensing, sensing report
transmission was carried out within the cluster (or) group
[36]. In each group, sensing reports were aggregated by CH
and transmitted to FC for global fusion. To avoid
interference during report transmission, CHs were
scheduled for report transmission. At FC, SUs which were
given incorrect report (untrusted SUs) were detected by
maximum likelihood (ML) estimator based on true distance
and error distance. Then the global decision was made with
sensing reports reported by trusted SUs. In this method,
each CH reports their aggregated sensing reports to FC in a
sequential specified order. Thus CH should wait until its
time slot even it already finished report aggregation. It is
worth to noting that all groups are not included with same
number of SUs (i.e.) aggregation time for each group is
varies with number of SUs presented. Hence waiting time
of CH for reporting sensing results is high.
In global decision making OR rule was applied at FC
[37]. Here author was focused on minimizing bandwidth
requirement by reducing number of terminals reporting to
FC. For this purpose the network was initially clustered by
minimal dominating set (MDS) clustering method and
proper CH was selected within each cluster. Upon
aggregated sensing decision form all CHs, FC made global
decision. OR rule was applied on aggregated sensing reports
for global decision making. However, in OR rule PU
absence decision is made if all CHs report the same (i.e.) if
all CH reports PU absence report then the decision made as
PU absence. Similarly, if anyone CH reports incorrect
report then the decision is made as PU presence which
prevents spectrum utilization. It also remarkable that
anyone cluster may report incorrect report for selfish
activities. Thus this method encourage the selfish malicious
activities of SUs while reduces spectrum utilization
efficiency.
Available PU spectrum was allocated to SUs in a QoS
aware manner [38]. Game theory approach was adapted for
spectrum allocation in an effective manner. Idea behind this
method was to utilize available spectrum in an efficient
manner by classifying SUs into real time SU and non-real
time SUs. Spectrum was allocated to real time SUs initially
and intervals introduced by real time SU were utilized by
non-real time SUs. Intervals during transmission were
4
ReView by River Valley Technologies
introduced since real time transmission was carried out by
voice over internet packets (VoIPs). Both SUs were selected
by auction game. The problem arises in this method is every
time non-real time user’s spectrum requirement is not
matched with intervals in real time users. In other words, if
spectrum required by non-real time SU is higher than
spectrum available in real time SU interval, then non-real
time SU is not able complete the transmission. Thus
selection of non-real time user is critical in this method.
The problems defined in this section are spectrum
sensing, decision making, and resource allocation. All these
problems are resolved by our proposed work. However,
these are major problems in CRN-CSS. By overwhelming
these problems, our proposed work is able to achieve better
Quality of Service for cognitive users.
IV. Proposed Work
4.1 System overview
Our proposed work in CRN-CSS is developed with the
aim of achieving efficient spectrum sensing and spectrum
allocation in CRN-CSS. A novel CRN-CSS architecture is
designed with following entities: primary users (PUs), SUs,
FC, SA, and primary base station (PBS). In this architecture
entities other than SUs are static in their positions while
SUs are dynamically moves around the network. In figure.1,
overview of our proposed CRN-CSS architecture is
OCA based
scheduling
SU
PBS
PU
ETED based
spectrum sensing
Figure.1 Overall architecture of proposed CRN-CSS with SA
2019/02/18 18:23:52 IET Review Copy Only
IET Circuits, Devices Systems
depicted. Here n number of SUs as 𝑆𝑈 =
{𝑆𝑈1 , 𝑆𝑈2 , . . , 𝑆𝑈𝑛 } and m number of PUs as 𝑃𝑈 =
{𝑃𝑈1 , 𝑃𝑈2 , . . , 𝑃𝑈𝑚 } are involved in the network. To support
cooperative spectrum sensing initially network is divided
into multiple groups based on one-hop neighbor approach.
Each group is assigned with sensing channels to perform
cooperative spectrum sensing. Interference avoidance and
spectrum sensing scheduling are achieved by OCA strategy
based on probability of detection constraint. Due to
involvement of OCA strategy, each SU senses each channel
which leads to higher sensing efficiency. Spectrum sensing
is improved even in noise uncertainties with the assist of
ETED method. Spectrum sensing decision from each SU in
each group is aggregated by group head (GH) and
transmitted to FC. Then FC performs two-stage allocation
scheme in which global decision making and spectrum
allocation processes are involved. In first stage, global
decision making is made by building mining tree for
aggregated reports from GHs and sensing report from SA
for particular channel. If PU absence decision is made, then
the SUs which reports accurate results are taken from
mining tree and fed into second stage. In second stage,
available spectrum is allocated for efficient SUs which
provide accurate reports by NFBSA scheme. Proposed
NFBSA scheme is efficient since spectrum allocation is
performed by considering major metrics of SUs.
NFBSA
Mining tree
Two-stage spectrum
allocation
One-hop group
formation
SA
GH
FC
5
ReView by River Valley Technologies
Thus two-stage spectrum allocation method improves
spectrum utilization as well as sensing efficiency with the
help of accurate sensing reports from SUs and optimal
spectrum allocation scheme.
4.2 One hop neighbor approach
One hop neighbor approach based grouping is the initial
process in CRN-CSS. Grouping of SUs supports effective
sensing channel assignment and sensing report gathering
processes. In one-hop neighbor approach, grouping process
is initiated by an active SU by sending group request (Req)
to its one-hop neighbors. Neighbor SUs which are interested
to join the group respond with (Res) message. One-hop
neighbor approach minimizes the grouping time since all
interested SUs are responded immediately. It also ensures
that all interested SUs are included in anyone of group. Let
SUi be the ‘ith’ SU in the network and initiated one-hop
neighbor approach based grouping process at time instance
‘t’. By means initiating grouping process, all one-hop
neighbors presented within the coverage range of SUi are
received Reqt message. If ‘l’ number of one-hop neighbors
presented within SUi’s coverage, then Reqt message is
received by l SUs. Upon receiving Reqt message, SUs
respond with Rest message to SUi. SUs which replied with
Res message are included in group ‘i’ formed by SUi. SUs
which are not interested in participating in sensing round
are not required to acknowledge. SUs which are replied
within the time constraint are included in group. Process of
one-neighbor based grouping approach is depicted in
algorithm.1. In proposed CRN-CSS, spectrum sensing
channel is assigned to SUs which are presented in anyone of
group in the network. Hence, SUs which are required to
perform spectrum sensing are joint to anyone group, if there
is no group is presented within in its coverage range, then
that SU act as initiator and starts group formation. In each
group, initiator which initiates the grouping process is act as
GH. And GH is responsible for aggregating sensing reports
from group members (GMs).
Algorithm 1:One-hop approach
1 Begin
2 Initialize 𝑆𝑈 = {𝑆𝑈1 , 𝑆𝑈2 , . . , 𝑆𝑈𝑛 },
3 For 𝑆𝑈𝑖 ∈ 𝑆𝑈
4 If (𝑆𝑈𝑖 == 𝑖𝑛𝑖𝑡𝑖𝑎𝑡𝑜𝑟)
5 For all one-hop neighbor 𝑆𝑈 ∈ 𝑆𝑈𝑙
6 Send 𝑅𝑒𝑞𝑡 → 𝑆𝑈𝑙
7 Else
8 Wait for 𝑅𝑒𝑞𝑡
9 End if
10 For each 𝑆𝑈 ∈ 𝑆𝑈𝑙
11 If(Interested in sensing)
12 Send 𝑅𝑒𝑠𝑡 → 𝑆𝑈𝑙
13 Else
14 Discard 𝑅𝑒𝑞𝑡
15 End if
16 End for
2019/02/18 18:23:52 IET Review Copy Only
IET Circuits, Devices Systems
17 End for
18 Elect 𝑆𝑈𝑖 → 𝐺𝐻
19 End
Selecting initiator as GH is an intellectual decision since
each GM in the group can communicate with GH within
single hop. Again one-hop approach strikes with an
advantage that it eliminates the unnecessary scheduling of
sensing channel for SUs which not interested in sensing.
Thus group formation supported by one-hop neighbor
approach results in minimized time consumption without
loss of performance. Thus at the end of one-hop neighbor
approach ‘k’ number of groups formed as follows 𝐺 =
{𝐺1 , 𝐺2 , . . , 𝐺𝑘 }. After group formation, set of sensing
channels (CS) is provided to each group by FC. In each
group, spectrum sensing scheduling is performed by OCA
strategy which is explained in next section.
4.3 OCA Strategy
As stated earlier, spectrum sensing scheduling and
channel assignment is an important process in order to
avoid sensing interference. For this purpose initially FC
assigns set of channels for each group. In each group, GH is
responsible to collect set of channels from FC and to assign
sensing channels to GMs. Spectrum sensing frame structure
in proposed work is depicted in figure.2.
T1
TS TT
Sensing Transmission
TCSS TR
CSS Reporting
TRS TRF
SU reporting to GH GH reporting to FC
Figure.2 Frame structure in proposed CRN-CSS
As shown infigure.2, time T1 is divided into TS and TT
corresponds to sensing time and transmission time. Sensing
time TS is further divided into CSS sensing time T CSS and
reporting time TR. Since SUs are grouped by one-hop
neighbor approach, reporting includes SUs reporting time
TRS and GH reporting time TRF. In this frame structure,
OCA strategy is applied in T CSS duration which further
divides the CSS sensing time into different rounds as
𝑇𝐶𝑆𝑆 = {𝑅1 , 𝑅2 , . . , 𝑅𝐶𝑆𝑆 }. In each round, set of channels are
provided to each group. Then the channels are scheduled for
each SU in the group by GH. Let assume that there is
channel set CS1 with five channels as 𝐶𝑆1 =
6
ReView by River Valley Technologies IET Circuits, Devices Systems

{𝐶𝐻1 , 𝐶𝐻2 , 𝐶𝐻3 , 𝐶𝐻4 , 𝐶𝐻5 } is provided to G1 for sensing at during spectrum sensing and each channel is sensed by each
round R1. And assume that G1 consists of five SUs as 𝐺1 = SU in the group. For instance sensing scheduling of SU1 is
{𝑆𝑈1 , 𝑆𝑈2 , 𝑆𝑈3 , 𝑆𝑈4 , 𝑆𝑈5 }. Here SU1 act as GH and other given in table.1. In this manner each SU senses assigned
SUs act as GMs. SU1 is responsible for sensing scheduling channel in assigned round dynamically. It is worth to notice
of CS1 to all group members in G1. Initially, SU1 assigns that CH1 is assigned to only SU1 at round R1.
candidate set for CH1 at R1 as 𝑐𝑎𝑛𝑑𝑖𝑑𝑎𝑡𝑒 𝑠𝑒𝑡 =
{𝑆𝑈1 , 𝑆𝑈2 , 𝑆𝑈3 , 𝑆𝑈4 , 𝑆𝑈5 }. From the set of SUs an optimal Table.1 Sensing Scheduling of SU1
SU which results high probability of detection on channel 1 Round Sensing Channel
is assigned to CH1 at R1. Then SU1 is removed from R1 CH1
candidate list to sense CH2. Similarly, SU which has high R2 CH3
probability of detection is assigned to CH2. In this manner R3 CH2
each SU is assigned with appropriate CH for sensing at R4 CH5
R1.Probability of detection for a SU on particular channel is R5 CH4
detected by, Thus other SUs are not able to sense CH1 and also other
2|ℎ𝑖 |2 𝜎𝑠 2 𝑁 |ℎ𝑖 |2 𝜎𝑠 2 SUs are assigned to other channels at the same round. Thus
𝑃𝑓 = 𝑄 (√ + 1) 𝑄−1 (𝑃𝐷 ) + √ (1) none of the channels is left idle and the interference
𝜎𝑣 2 2 𝜎𝑣 2
between SUs is avoided. In algoritm.2, process of OCA
Probability of detection (PD) is determined based on channel strategy is descripted.
gain (hi), probability of false alarm (P f), and uncertainty
factor 𝜎𝑠 ) of particular SUi and channel s. At each sensing Algorithm 2: OCA strategy
round, SU is provided with optimal channel. Thus in the 1 Begin
group each SU senses different channel at different time and 2 Initialize 𝐺 = {𝐺1 , 𝐺2 , . . , 𝐺𝑘 }, 𝐶𝑆 =
no channel and SU is left idle. OCA based channel 3 {𝐶𝑆1 , 𝐶𝑆2 , . . , 𝐶𝑆𝑘 }, max R
assignment strategy is depicted in figure.3. 4 For each 𝐺
5 Assign 𝐶𝑆
6 For each 𝐶𝐻 ∈ 𝐶𝑆
TCSS 7 For each 𝑆𝑈 ∈ 𝐺
8 Find 𝑃𝐷 using (1)
R1 R2 R3 R4 R5 9 If (𝑃𝐷 (𝑆𝑈) == ℎ𝑖𝑔ℎ)
10 Assign 𝐶𝐻 → 𝑆𝑈
SU1 SU2 SU3 SU4 SU5 11 Else
CH1 12 Goto next SU
13 End if
14 Do
CH2 SU5 SU4 SU1 SU2 SU3 15 Until R==Max R
16 End for
17 End for
CH3 SU2 SU5 SU3 SU4
18 End for
SU1
19 End

The assigned channel is sensed by SU in ETED method. In

CH4 SU4 SU3 SU2 SU5 SU1 ETED method, threshold is computed dynamically. In
threshold computation, noise uncertainty and probability of
error factor are considered in order to improve sensing
efficiency even in low SNR values. In traditional energy
CH5 SU3 SU5 SU4 SU1 SU2
detection method, PU status is detected based on two
hypotheses as follow,
𝑤(𝑛)𝑗 , 𝐻0
𝑋(𝑛) = { (2)
𝑠(𝑛) + 𝑤(𝑛), 𝐻1
Figure.3 OCA strategy
Hypothesis test is made on received signal X(n). Here H0
As per the figure, SU1 senses all five channels as following represent the absence of PU signal and presence of only
sensing rounds: R1, R3, R2, R5, and R4 (i.e.) SU1 senses CH1 noise signal w(n). Whereas H1 represents presence of PU
at R1 and senses CH2 at R3 and so on. Thus from the figure, signal s(n) with noise signal. By receiving signal samples,
it is clear that there is no interference occurs between SUs energy of received signal is computed by SU as follows,

2019/02/18 18:23:52 IET Review Copy Only 7

ReView by River Valley Technologies
𝐸𝑗 = ∑𝑄𝑞=1 𝑋(𝑛)2
Q represents number of signal samples. Then computed
energy is compared with detection threshold. If energy of
the signal is higher than threshold value (𝜆), then it is
concluded that PU presence, i.e., H1 otherwise it is
concluded that PU absence, i.e., H0. It is difficult to find
optimal detection threshold in ED method since the signal
energy computation includes channel metrics. Due to
uncertainty and noise factor of the channel, conventional
ED method is infeasible for practical scenarios. So we have
proposed an optimal threshold detection method namely
ETED method that includes channel uncertainty and noise
factor in threshold detection. New threshold value is
computed as follow,
𝜆 decision. From global decision making, SUs which are
𝜆𝑛𝑒𝑤 = ∑ (4)
𝜌𝑖 ,𝑃𝑒
Dynamic threshold value is computed by considering noise
uncertainty factor (𝜌𝑖 ) and probability of sensing error (𝑃𝑒 ).
For every spectrum sensing round, this threshold is
computed on order to improve sensing efficiency. Here
error probability Pe is computed as follows,
𝑃𝑒 = 𝑃𝐻0 𝑃𝑓 + 𝑃𝐻1 𝑃𝑚 (5)
Where PHo+PH1=1 and Pf denotes false alarm probability,
Pm denotes miss detection probability. When sensing error
is minimized then it is obvious that sensing efficiency is
increased. Similarly, noise uncertainty factor is computed as
follows,
max 𝜎 2 (𝑞)
1≤𝑞≤𝑄 𝑖
𝜌𝑖 = 1 𝑄 (6)
∑ 𝜎 2 (𝑞)
𝑄 𝑞=1 𝑖
In above equation.(5), noise uncertainty factor for SUi is
computed in terms of noise variance (𝜎) of signal samples.
Based on new threshold, the channel status is detected in
ETED method. The reason behind dynamic threshold value
is that noise uncertainty for each channel varies over the
time. Decision on PU status is taken as follows,
𝑃𝑈 𝑖𝑠 𝑝𝑟𝑒𝑠𝑒𝑛𝑡 𝐸𝑖 ≥ 𝜆𝑛𝑒𝑤 (𝑖)
𝐷𝑒𝑐𝑖𝑠𝑖𝑜𝑛 = { (7)
𝑃𝑈 𝑖𝑠 𝑎𝑏𝑠𝑒𝑛𝑡 𝐸𝑖 < 𝜆𝑛𝑒𝑤 (𝑖)
Sensing report of each SU is sent to GH and aggregated
reports are sent to FC. Each SU send sensing report as
binary value as per PU status as follows,
Table.2 Sensing report
Hypothesis Report PU status
H1 0 PU presence, i.e.,
channel is busy
H0 1 PU absent, i.e., channel
is idle
SU sends sensing report as {SUi, 0/1, H0/H1}. Here SUi
represents that the result is sent by ‘ith’ SU. Sensing
reporting by SUs is performed in T RS whereas aggregated
2019/02/18 18:23:52 IET Review Copy Only
IET Circuits, Devices Systems
(3) report transmission is performed at T RF by GH. If spectrum
is available for SUs, then the available spectrum is allocated
to optimal SUs by two-stage allocation scheme.
4.4 Two-stage spectrum allocation
In this section we discuss about two-stage spectrum
allocation process including global decision making and
spectrum allocation process. FC is responsible for decision
making and spectrum allocation in our work. In this process
SA which is a new entity included in CRN-CSS plays vital
role. Here global decision making is achieved with the
knowledge of SA sensing report in FC. SA is a new entity
that performs spectrum sensing only for FC. In our work,
the major responsibility of SA is to sense the channel and
reports to FC. Upon SA’s report, FC perform global
reported accurate sensing report are detected. Thus
detection of effective SUs in terms of spectrum sensing is
first stage of two-stage allocation. Then the effective SUs
are fed into neuro-fuzzy inference system in second stage.
Both processes are detailed below.
4.4.1 Global Decision Making
In this stage, FC aggregates all SUs sensing reports
through GHs and also receives sensing report from SA.
Hereby SA’s report is always assured with accurate results
while reports from SUs are not stable. For each sensing
channel, SA reports PU status and SUs also report sensing
decisions. Based upon received reports, FC builds a mining
tree for global fusion. Mining tree construction considers
SA report as root and other SUs reports are compared with
root in order to build tree. Consider sensing reports
aggregated from SUs for set of channels CS1 at time TCSS
depicted in table.3.
Table.3 Spectrum Sensing Reports
SU/CH CH1 CH2 CH3
SU1 0 1 1
SU2 1 1 1
SU3 1 0 1
SU4 0 0 0
SU5 1 0 1
SA 0 1 1
Based on aggregated sensing reports, mining tree is built for
each channel as shown in figure.4. From mining tree, SUs
which are sensed spectrum accurately detected. Here SUs
reports which are equal to SA’s report are added as left
child nodes similarly SUs reports which are differ from
SA’s report are added as right child nodes.
In figure.4, SUs with accurate reports are highlighted.
Global decision on PU status is made upon the mining tree.
It is easy to extract SUs with accurate sensing reports from
mining tree for next stage (i.e.) for spectrum allocation.
Here only SUs which provide accurate sensing results only
are provided with spectrum in next stage.
8
ReView by River Valley Technologies IET Circuits, Devices Systems

SU which has highest spectrum efficiency is able to utilize

available spectrum on the channel to maximum. For each
channel, spectrum efficiency is computed with respect to
CH2 available spectrum on that particular channel.
CH1
Sensing Power: Sensing power is considered since SU
which utilize available power will result is high spectrum
utilization.

Velocity: Here velocity plays vital role in spectrum

CH3 utilization since when velocity varies then the position of
SA SU3
SU also changed.
SU4
Thus considering of these optimal metrics results in high
SU1
spectrum utilization. Consider sensing reports in table.3 and
SU5
global decision in figure.4. Eligible SUs for available
SU2
spectrum is depicted in figure.5. Here CH1 is in busy state
Figure.4 Mining tree for global decision making while other two channels are in idle state. From first stage,
SU1 and SU2 are eligible to access CH2 spectrum since they
The behind fact is that if a SU require spectrum, then it result accurate sensing report. Similarly SU1, SU2. SU3, and
perform spectrum sensing accurately. It is also remarkable SU5 are eligible to access available spectrum on CH3. From
that spectrum sensing error is minimized by ETED method. the figure, it is obvious that SU1 and SU2 get high
Hence the spectrum sensing result should be accurate. probability of spectrum access since they sense both
channels accurately. From SU1 and SU2, optimal SU is
4.4.2 NFBSA Scheme selected to utilize spectrum on CH2. In above example, SU1
SUs which are selected for spectrum allocation are fed is allocated with CH2 spectrum and SU5 is allocated with
into second stage in which NFBSA scheme is employed. In CH3 spectrum by NFBSA scheme. In practical, number
this stage, optimal SUs for spectrum utilization are selected channels and number of SUs are large. To ensure minimum
based on spectrum efficiency, sensing power, and velocity. time consumption in spectrum allocation process, neuro-
In NFBSA scheme appropriate fuzzy rules are incorporated fuzzy model is incorporated. Involvement of neural network
accordance to spectrum efficiency, sensing power, and supports large number of SUs and channels in each time
velocity. SU with high spectrum efficiency, sensing power instance.
utilization, and low velocity is allocated with required
spectrum. In this manner, available spectrum is allocated to Algorithm 3: Two-stage spectrum allocation
optimal SUs. Each metric can be explained as follows, 1 Begin
Spectrum efficiency: Spectrum efficiency of a SU is 2 Initialize sensing reports (SRs)
detected as follows, 3 Obtain report from SA (SAR)
𝑆𝑝𝑒𝑐𝑡𝑟𝑢𝑚 𝑟𝑒𝑞𝑢𝑖𝑟𝑒𝑑 𝑏𝑦 𝑆𝑈
𝑆𝑝𝑒𝑐𝑡𝑟𝑢𝑚 𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑐𝑦 = (8) 4 For each 𝐶𝐻
𝑇𝑜𝑡𝑎𝑙 𝑎𝑣𝑎𝑖𝑙𝑎𝑏𝑙𝑒 𝑠𝑝𝑒𝑐𝑡𝑟𝑢𝑚
5 Assign 𝑆𝐴𝑅 → 𝑅𝑜𝑜𝑡
CH1 CH2 CH3 6 For each 𝑅𝑒𝑝𝑜𝑟𝑡 ∈ 𝑆𝑅
7 Compare with 𝑆𝐴𝑅
8 If (𝑆𝑅 == 𝑆𝐴𝑅 )
NFBSA based
9 Assign 𝑆𝑅 → 𝐿𝑒𝑓𝑡
spectrum allocation 10 Else
11 Assign 𝑆𝑅 → 𝑅𝑖𝑔ℎ𝑡
12 End if
13 End for
14 Obtain 𝑀𝑇 for each CH
15 End for
16 Obtain Qualified SUs (Q-SUs) from MT
17 For each CH
18 For each Q-SU
19 Apply fuzzy rules
20 Find optimal SU
Detected SUs from 21 End for
mining tree 22 Assign 𝑒𝑎𝑐ℎ 𝐶𝐻 → 𝑜𝑝𝑡𝑖𝑚𝑎𝑙 𝑆𝑈𝑠
Figure.5 Qualified SUs for spectrum access 23 End for

2019/02/18 18:23:52 IET Review Copy Only 9

ReView by River Valley Technologies IET Circuits, Devices Systems

24 End detector [9], enhanced ED [13], energy with correlation

detection [14], majority rule [19], ED with Fusion rules
Algorithm.3 explains the process of two-stage spectrum [30], selective cluster [31], cluster based CSS [35], and
allocation with mining tree based global decision making Two-tier spectrum allocation method [38] based on
and NFBSA scheme. Henceforth, our proposed work significant metrics such as sensing efficiency, spectrum
improves CRN-CSS in terms of sensing efficiency and utilization efficiency, energy efficiency, and probability of
spectrum utilization efficiency with small time and energy detection.
consumption.
Table.5 Drawbacks in previous works
V. Performance Evaluation Existing work Demerit
Improved ED • Global decision making is not
In this section we compare our proposed two-stage accurate
spectrum allocation scheme with existing state-of-the art • Not able to consider channel
works in terms of performance metrics. This section is uncertainty
comprised with two subsections such as simulation ED with Fusion • Conventional ED method is not
environment and comparative analysis. rules efficient
• Ineffectual global decision
5.1 Simulation Environment making
In order to support our proposed CRN-CSS work NS3
Selective cluster • Poor performance in low SNR
network simulator is installed on Ubuntu operating system.
method
NS3 is a discrete network event simulator that supports
different types of network. To utilize advantages of NS3, Cluster based CSS • Grouping SUs is performed in
we have preferred NS3 for our implementation. ineffectual manner
• Spectrum sensing efficiency is
Table.4 Simulation parameters low due to pruning of SUs
Parameter Value Two-tier method • Spectrum utilization is not
Number of SUs 20 efficient due to mismatches
Network Number of PUs 4 between spectrum requirement
entities Number of PBS 1 of real time and non-real time
Number of FC 1 SUs.
Number of SA 1 Table.5, outlines the problems existed in previous works
Mobility model of SU Random waypoint which lead to performance degradation. In following
mobility model section, significance of these problems is discussed
Mobility speed of SU 100 m/s accordance to comparative analysis. Our proposed work
Sensing duration 100ms obtains time complexity of 𝑂(𝑛7 log(𝑛)) for executing one-
hop neighbor approach based group formation, OCA
Transmission duration Max 500 ms
strategy based channel assignment, and two-stage spectrum
Packet interval 10 ms
allocation. However, our work consumes slightly large time
Data rate 100 Gb/s
but results in high sensing efficiency and spectrum
Initial energy 300 J utilization.
SNR Range Min -120dB 5.2.1 Comparative analysis on sensing efficiency
Bandwidth 25 MHz Sensing efficiency is vital metric to evaluate
NFBSA Number of 2 performance of spectrum sensing method. In order to
hidden layers evaluate proposed ETED method in two-stage CRN-CSS,
Number of 10 we have included this metric. For an efficient spectrum
neurons sensing method, sensing efficiency should be high as
Simulation time 5s possible.

Simulation parameters that are considered in implantation
of proposed CRN-CSS is provided in table.4. Considering
all above simulation parameters, proposed CRN-CSS
network is constructed and all algorithms are implemented.
5.2 Comparative Analysis
In this subsection we compare our proposed two-stage
based CRN-CSS with other existing works improved energy
In figure.6, we compare our proposed ETED method with
mining tree based data fusion against ED method with AND
rule OR rule, and majority rule methods. From the graphical
comparison we can see that sensing efficiency in ETED
method in two-stage CRN-CSS is gradually increased while
conventional ED method decreases with increase in number
of SUs. This is because when number of SUs increases then
problems such as channel starvation for sensing and

2019/02/18 18:23:52 IET Review Copy Only 10

ReView by River Valley Technologies
interference during sensing are raised. But in two-stage
CRN-CSS, effective sensing scheduling through OCA
strategy is accomplished before performing ETED method.
Two-stage CRN-CSS
ED with OR rule
100 ED with AND rule
95 ED with Majority rule
Enhanced ED
Sensing efficiency (%)
90 Energy with correlation detection
85 Majority rule
80
75
70
65
60
55
50
2 5 10 15
Number of cooperative SUs
Figure.6 Comparative analysis on sensing efficiency
Thus ETED method increases spectrum efficiency with
increase in number of SU whereas conventional ED method
decreases sensing efficiency with increase in number of
SUs. However, one can ask then why ETED method strikes
with sensing efficiency as 60% in the presence of 2 SUs
which is relatively smaller than conventional ED method.
The reason behind this fact is varying transmission time
(i.e.) when transmission time is increased then spectrum
sensing time is decreased. In conventional ED method [27]
transmission time is considered as 3 seconds which is
relatively smaller than ETED method. This variation shows
that, conventional ED method consumes more sensing time
to attain better result. However when number of SUs
increased then conventional ED method is not able to
sustain while ETED method achieves better sensing
efficiency. ETED method achieves 70.8% of sensing
efficiency whereas ED with OR rule provides 71% of
sensing efficiency,ED with AND rule provides 68.5% of
sensing efficiency, and ED with majority rule provides 69%
of sensing efficiency.
5.2.2 Comparative analysis on spectrum utilization
efficiency
This metric evaluates the performance of spectrum
allocation scheme. This metric measures that how available
PU spectrum is utilized by SUs in CRN. The major aim of
CRN-CSS is to utilize available spectrum in order to
overwhelm spectrum scarcity problem. Thus this metric
should be high as possible. For an instance 100% of
spectrum utilization refers that whole available spectrum is
utilized by SUs.
In figure.7, comparison on spectrum utilization efficiency is
depicted. Here it is obvious that proposed CRN-CSS utilize
2019/02/18 18:23:52
IET Circuits, Devices Systems
available spectrum in an effective and intellectual manner.
Involvement of two-stage spectrum allocation scheme
including mining tree based global decision making and
NFBSA scheme based spectrum allocation realizes high
spectrum utilization in two-stage allocation scheme.
Two-stage CRN-CSS
Two-tier method
90
Enhanced ED
Energy with correlation detection
80 Majority rule
Sensing efficiency (%)
70
60
50
40
30
20
20 10
0
2 5 10 15 20
Number of cooperative SUs
Figure.7 Comparative analysis on spectrum utilization
efficiency
And spectrum is not utilized in two-tier method since non-
real time SU selection is difficult in this work. In two-tier
method, if non-real time SU require spectrum more than
real time SU then spectrum scarcity occurs. The other
methods such as enhanced ED, majority rule, and energy
with correlation detection methods are not able to achieve
spectrum utilization more than 20% since all methods are
only focused on either sensing or decision making. Thus
this analysis shows the importance of spectrum allocation in
CRN. Similarly when spectrum required by non-real time
SU is smaller than real-time SU then spectrum
underutilization occurs. Nearly 20% spectrum utilization
efficiency is improved in two-stage allocation scheme
compared to two-tier method.
5.2.3 Comparative Analysis on Energy efficiency
This metric is inversely proportional to energy
consumed by the network during sensing period. Energy
consumption includes energy consumed by grouping
process, scheduling process, sensing, and global fusion.
Higher this metric shows higher efficiency of the network.
Figure.8 compares the energy efficiency of proposed two-
stage allocation scheme with existing cluster based CSS and
selective cluster method in terms of energy consumption. If
energy consumption in the network is small then energy
efficiency of the network is high. In above comparison, it is
clear that two-stage strategy achieves better energy
efficiency than existing works.
IET Review Copy Only 11
ReView by River Valley Technologies
Two-stage CRN-CSS
Cluster based CSS
Selective cluster method
90 Enhanced ED
80 Energy with correlation detection
Majority rule
Energy efficiency(%)
70
60
50
40
30
20
10
0
2 10 5 15 20
Number of SUs
Figure.8 comparative analysis on energy efficiency
In existing work, sensing efficiency is not fair in low SNR.
Thus it consumes more energy for spectrum sensing and
decision making. Similarly grouping of SUs involved with
multiple steps in which energy consumption is high. But in
two-stage strategy, one-hop approach form groups without
increase in energy consumption and time consumption.
Similarly global decision making by mining tree is able to
aggregate all SU’s reports without any external process.
Neuro-fuzzy based allocation scheme reduces energy
consumed by spectrum allocation process. Thus each
process involved in two-stage strategy minimizes energy
consumption and achieves average energy efficiency as
75% which is significantly higher than existing works.
5.2.4 Comparative Analysis on Probability of detection
Probability of detection assures that PU channel status
(idle or busy) is detected accurately. It impacts on global
decision and spectrum allocation. Thus this metric should
be high as possible.
Comparative analysis on probability of detection between
proposed two-stage CRN-CSS and previous improved ED
method is illustrated in figure.9. Without any arguments, we
can confirm that ETED method in two-stage CRN-CSS
outperforms in probability of detection. Major reason for
lowest probability of detection is noise uncertainty. This
analysis confirms that ETED method is able to sense
accurately even in the presence of uncertainty. Here
improved ED method is analyzed with single time slot and
two time slots. Even with two time slots, improved ED
method strikes with minimum probability of detection than
ETED method with single time slot.
2019/02/18 18:23:52
IET Circuits, Devices Systems
Two-stage CRN-CSS with slot=1
Improved energy detector with slot=1
Improved energy detector with slot=2
Enhanced ED
Energy with correlation detection
0.25
majority rule
Probability of detection
0.2
0.15
0.1
0.05
0
0.2 0.4 0.6 0.8 1
Sensing time (s)
Figure.9 Comparative analysis on probability of detection
Henceforth proposed ETED method in two-stage CRN-CSS
achieves better probability of detection than existing works
without increasing sensing time. Average probability of
detection in ETED method is 0.2 which is twice better than
maximum probability of detection in improved ED method.
VI. Conclusion
In this paper, we resolved the problem of spectrum
sensing and spectrum allocation in CRN-CSS with the
support of spectrum agent. CRN-CSS is supported by group
formation process driven by one-hop neighbor approach.
Sensing channel interference and sensing channel starvation
are overwhelmed by scheduling sensing channels to SUs.
Sensing channel scheduling is carried out by OCA strategy
which assures that each SU senses all channels and no
channel is left idle. Key idea behind sensing scheduling is to
sense all available channels to explore available spectrum in
each channel. ETED based spectrum sensing improves
sensing efficiency. After spectrum sensing, two-stage
spectrum allocation scheme is employed to detect all
available spectrum through global decision making and to
utilize available spectrum through spectrum allocation. For
this purpose, mining tree based global decision making
scheme and NFBSA based spectrum allocation scheme are
incorporated. Involvement of finest processes in each stage
improves sensing efficiency and spectrum efficiency
together in CRN-CSS. In future, we have planned to extend
work to large scale network with real world scenario in
order to evaluate our proposed work. We are also planned to
incorporate security scheme in order to improve security of
the network.
References
IET Review Copy Only 12
ReView by River Valley Technologies
[1] Ekram Hossain, Dusit Niyato, Dong In Kim: ‘Evolution
and future trends of research in cognitive radio: a
contemporary survey’, Wireless Communications and
Mobile Computing, Wiley Online Library, 2015, 15, pp.
1530-1564.
[2] Shree Krishna Sharma, Tadilo Endeshaw Bogale,
Symeon Chatzinotas, Bjorn Ottersten, Long Bao Le,
Xianbin Wang: ‘Cognitive Radio Techniques under
Practical Imperfections: A Survey’, IEEE Communication
Surveys and Tutorials, 2015, 17, (4), pp. 1858-1884.
[3] Abdelmohsen Ali, Walaa Hamouda: ‘Advances on
Spectrum Sensing for Cognitive Radio Networks: Theory
and Applications’, IEEE Communications Surveys &
Tutorials, 2017, 19, (2), pp. 1277-1304.
[4] Ying Wang, Gaofeng Nie, Gen Li, Cong Shi: ‘Sensing-
Throughput Tradeoff in Cluster-Based Cooperative
Cognitive Radio Networks with A TDMA Reporting Frame
Structure’, Wireless Personal Communications, Springer,
2013, 71, (3), pp. 1795-1818.
[5] Arijit Nath, Nityananda Sarma: ‘A distributed solution
for cooperative spectrum sensing scheduling in multiband
cognitive radio networks’, Journal of Network and
Computer Applications, Elsevier, 2017, 94, pp. 69-77.
[6] Zhe Liu, Changle Li: “On spectrum allocation in
cognitive radio networks: a double auction-based
methodology”, Wireless Networks, Springer, 2017, 23, (2),
pp. 453-466.
[7] Prakash Chauhan, Sanjib K. Deka, Monisha Devi,
Nityananda Sarma: ‘Cooperative Spectrum Sensing
Scheduling in Multi-channel Cognitive Radio Networks: A
broad perspective’, Networking and Internet Architecture,
2017.
[8] Ejaz Ahmed, Abdullah Gani, Saeid Abolfazli, Liu Jie
Yao, Samee U. Khan: ‘Channel Assignment Algorithms in
Cognitive Radio Networks: Taxonomy, Open Issues, and
Challenges’, IEEE Communications Surveys and Tutorials,
2016, 18, (1), pp. 795-823.
[9] Abhijt Bhowmick, Kuldeep Yadav, Sanjay Dhar Roy,
Sumit Kundu: “Multi slot-throughput tradeoff in an
improved energy detector based faded cognitive radio
network”, Wireless Networks, Springer, 2017, pp. 1-14.
[10] Ibrahim Salah, Waleed Saad, Mona Shokair, Mohamed
Elkordy: ‘Cooperative Spectrum Sensing and Clustering
Schemes in CRN: A Survey’, Proc. Int. Conf. Computer and
Engineering, Egypt, 27-28, December, 2017.
[11] Saud Althunibat, Marco Di Renzo, Fabrizio Granelli:
‘Towards Energy-Efficient Cooperative Spectrum Sensing
for Cognitive Radio Networks-An Overview’,
Telecommunication Syst, Springer, 2015, 59, (1), pp. 77-91,
2015.
[12] Tripta and Dr.Vikas Sindhu, Singh, V.R.: ‘Techniques
for Energy Detection in Cognitive Radio for Spectrum
Sensing: A Case Study’, International Journal on Advanced
Research in Computer Science, 2017, 8, (5).
[13]
[14]
2019/02/18 18:23:52 IET Review Copy Only
IET Circuits, Devices Systems
[15] Tadilo Endeshaw Bogale, Luc Vandendorpe: ‘Max-
Min SNR Signal Energy based Spectrum Sensing
Algorithms for Cognitive Radio Networks with Noise
Variance Uncertainty’, IEEE Transactions on
Communications, 2014, 13, (1), pp. 280-290.
[16] Argin Margoosian, Jamshid Abouei, Konstantinos N.
Plataniotis: ‘An Accurate Kernelized Energy Detection in
Gaussian and non-Gaussian/Impulsive Noises’, IEEE
Transactions on Signal Processing, 63, (21), pp. 5621-5636.
[17] Chang Liu, Ming Li, Ming-Lu Jin: ‘Blind Energy-
Based Detection for Spatial Spectrum Sensing’, IEEE
Wireless Communications Letters, 2015, 4, (1), pp. 98-101.
[18] Liu Xin, Zhong Wei-zhi, Chen Kun-qi: ‘Optimization
of sensing time and cooperative user allocation for OR-rule
cooperative spectrum sensing in cognitive radio network’,
Journal of Central South University, Springer, 2015, 22, (7),
pp. 2646-2654.
[19]
[20] Saud Althunibat, Fabrizio Granelli: ‘On Results’
Reporting of Cooperative Spectrum Sensing in Cognitive
Radio Networks’, Telecommunications Systems, Springer,
2016, 62, (3), pp. 569-580.
[21] Wenjuan Lu, Zizhong Quan, Quan Liu, Duzhong
Zhang, Wenjun Xu: ‘QoE Based Spectrum Allocation
Optimization Using Bees Algorithm in Cognitive Radio
Networks’, Proc. Int. Conf. Algorithms and Architecture of
Parallel Processing, pp. 327-338, 2015.
[22] Jie Huang, Xiaoping Zeng, Xiaoheng Tan, Xin Jian,
Yuan He: ‘Spectrum Allocation for Cognitive Radio
Networks with Non-Deterministic Bandwidth of Spectrum
Hole’, china Communications, 2017, 14, (3), pp. 87-96.
[23] Badr Benmammar, Mohammed Housseyn Taleb,
Francine Krief: ‘Diffusing-CRN k-means: an improved k-
means clustering algorithm applied in cognitive radio ad
hoc networks’, Wireless Networks, Springer, 2017, 23, (6),
pp. 1849-1861.
[24] Haythem Bany Salameh, Mohammad El-Attar:
‘Cooperative OFDM-based Virtual Clustering Scheme for
Distributed Coordination in Cognitive Radio Networks’,
IEEE Transactions on Vehicular Technology, 2015, 64, (8),
pp. 3624-3632.
[25] Xiukui Li, Seyed A. (Reza) Zekavat: ‘Group-based
cognitive radio network formation without common
channels', IET Networks, 2015, 4, (4), pp. 235-246.
[26] Lamiaa Khalid, Alagan Anpalagan: ‘Adaptive
Assignment of Heterogeneous Users for Group-Based
Cooperative Spectrum Sensing’, IEEE Transactions on
Wireless Communications, 2016, 15, (1), pp. 232-246.
[27] Hongjuan Li, Xiaoshuang Xing, Junda Zhu, Xiuzhen
Cheng, Keqiu Li, Rongfang Bie, Tao Jing: ‘Utility-Based
Cooperative Spectrum Sensing Scheduling in Cognitive
Radio Networks’, IEEE Transactions on Vehicular
Technology, 2017, 66, (1), pp. 645-655.
[28] Tran Nhut Khai Hoan, Insoo Koo: ‘Multi-slot
Spectrum Sensing Schedule and Transmitted Energy
Allocation in Harvested Energy Powered Cognitive Radio
13
ReView by River Valley Technologies IET Circuits, Devices Systems

Networks under Secrecy Constraints’, IEEE Sensors

Journal, 2017, 17, (7), pp. 2231-2240.
[29] A.J. Onumanyi, E.N. Onwuka, A.M Aibinu, O.C.
Ugweje, M.J.E. Salami, ‘A Modified Otsu’s Algorithm for
Improving the Performance of the Energy Detector in
Cognitive Radio’, AEU-International Journal of Electronics
and communications, Elsevier, 2017, 79, pp. 53-63.
[30] Yang, L., Song, S.H., Letaief, K.B.: ‘Optimizing
Spectrum Sensing Efficiency in Cognitive Radio
Networks’, Proc. Int. Conf. Computing, Communications,
and Applications, 2012.
[31] Nhan Nguyen-Thanh, Insoo Koo: ‘A cluster-based
selective cooperative spectrum sensing scheme in cognitive
radio’, EURASIP Journal on Wireless Communications and
Networking, Springer, 2013.
[32] Ruilong Deng, Jiming Chen, Chau Yuen, Peng Cheng,
Youxian Sun: ‘Energy-efficient Cooperative Spectrum
Sensing by Optimal Scheduling in Sensor-aided Cognitive
Radio Networks’, IEEE transactions on Vehicular
Technology, 2012, 61, (2), pp. 716-725.
[33] Piyush Bhardwaj, Ankita Panwar, Onur Ozdemir,
Engin Masazade, Irina Kasperovich, Andrew L. Drozd,
Chilukuri K. Mohan, Pramod K. Varshney: ‘Enhanced
Dynamic Spectrum Access in Multiband Cognitive Radio
Networks via Optimized Resource Allocation’, IEEE
Transactions on Wireless Communications, 2016, 15, (12),
pp. 8093-8106.
[34] Yousefvand, M., Ansari, N., Khorsandi, S.:
‘Maximizing Network Capacity of Cognitive Radio
Networks by Capacity-aware Spectrum Allocation’, IEEE
Transactions on Wireless Communications, 2015, 14, (9),
pp. 5058-5067.
[35] Yan Jiao, Peitong Yin, Inwhee Joe: ‘Clustering scheme
for cooperative spectrum sensing in cognitive radio
networks’, IET communications, 2016, 10, (13), pp. 1590-
1595.
[36] Mahsa Ghaznavi, Azizollah Jamshidi: ‘A Reliable
Spectrum Sensing Method in the Presence of Malicious
Sensors in Distributed Cognitive Radio Network’, IEEE
Sensors Journal, 2015, 15, (3), pp. 1810-1816.
[37] S. Hussain, X. Fernando: ‘Approach for cluster-based
spectrum sensing over band-limited reporting channels’,
IET Communications, 2012, 6, (11), pp. 1466-1474.
[38] Asmita Roy, Sadip Midya, Koushik Majumder,
Santanu Phadikar, Anurag Dasgupta:, ‘Optimized
Secondary User Selection for Quality of Service
Enhancement of Two-tier Multi-User Cognitive Radio
Network: A Game Theoretic Approach’, Computer
Networks, Elsevier, 2017, 123, pp. 1-18.

2019/02/18 18:23:52 IET Review Copy Only 14