Spectrum Handoff using Invasive Weed
Optimization Algorithm in Cognitive Radio
Networks
Akanksha Jain
Department of Electronics Engineering
Vellore Institute of Technology, Vellore, India
akankshaakjain@gmail.com
Abstract— Cognitive radio (CR) is an insightful intelligent
technology that aspires to enhance the use of the underutilized
spectrum. This intent is carried out by Spectrum Handoff which
allows the unlicensed secondary users (SUs) to use the licensed
frequency bands of the primary users (PUs). Moreover, SU is
helped to vacate the channel at the presence of the PU and find a
suitable channel to continue the unfinished transmission. In this
paper, an investigative analytical model for the general case of
non-identical channels (non-ideal) in CR networks is introduced
for optimization of both fixed and probabilistic sequence
approaches of target channel selection. This paper also
introduces a novel numerical stochastic optimization algorithm
inspired from colonizing weeds and implemented suitably. Both
the fixed and probabilistic under proactive target channel
selection approach are optimized using the meta-heuristic
method of nature-inspired Invasive Weed Optimization (IWO),
pre-existent in the electrical domain. This optimisation algorithm
is homogenised in the resolve of finding an optimal approach in
the Cognitive radio network to minimize the extended data
delivery time of the SUs which is a major limiting factor. The
reported optimization results are collated and compared with
non-identical channel case in recent evolutionary-based
algorithms meta-heuristics of Genetic algorithm (GA) and
Particle Swarm Optimization (PSO). The results are in
association to the pre-emptive resume priority (PRP) M/M/1
queueing network model.
Keywords— Cognitive radio, Invasive Weed Optimization,
fixed sequence approach, metaheuristics, non-identical channels,
pre-emptive priority, probabilistic sequence approach.
I. INTRODUCTION
Cognitive radio is an intelligent device which aims to
maximize the use of limited frequency resources by permitting
the unlicensed secondary users (SUs) to use the licensed
frequency bands in the duration of its idleness and not being
used by the licensed primary users (PUs) [1],[2]. Spectrum
handoff helps the SU in vacating the spectrum of licensed PU
after being interrupted by PU during the course of its
transmission. Moreover, it helps the interrupted SU to find a
suitable target channel and continue his unfinished
transmission with the help of handoff technique [1], [2].
For the selection of target channel there are two broad
approaches: proactive target selection approach and reactive
target selection approach [3], [4], [5], [6]. The proactive target
Aditi Singh
Department of Electronics Engineering
Vellore Institute of Technology, Vellore, India
aditigene@gmail.com
channel selection approach is further subdivided into fixed [3],
[5] and probabilistic sequence approaches [4], [7], [8]. An
optimal target channel selection sequence or probability
distribution is obligatory for any transmission to achieve high
QoS, minimum delay, and high transmission rate. In our
paper, for simplification the SU is assumed to always stay at
his initial channel after each interruption. The transition
probability matrix is assumed to be constant during
optimization of probability vector and selecting the initial
channel in order to simplify the optimization problem. As per
all previous work based on queueing theoretic framework
which assumed both non-identical channels (different service
rate) and identical channels (same service rate) led to a
considerable amount of extended data delivery time in
secondary user [8], [9]. Extended data delivery time is a toxic
element which leads reduces system performance. Different
optimization algorithms have been carried out in the past to
reduce this toxicity but led to a sundry of problems like
premature convergence, limitations in population size and
maximum number of iterations, which brought forward the
need of IWO Algorithm. This novel approach has been
implemented in the wireless domain for the first ever known
time because of its recognized efficiency in optimizing
spectrum state and reducing extended data delivery time in SU
with the increase in average arrival rate of PU. Also, a
comparative analysis is brought between the optimum
solutions of nature-inspired metaheuristic approaches: Genetic
Algorithm, Particle Swarm optimization [11] and IWO.
Promising results have been achieved in IWO Algorithm
which was earlier existing only in the electrical domain to be
remarkable in reducing extended data delivery time. To
understand efficiency better, the optimization results are
compared with the IEEE 802.22 WRAN standard. Our
contributions in this paper can be enlisted as follows:
 Optimization of the probabilistic and fixed sequence
approaches matrices for minimizing extended data
delivery time. Thereafter, comparing the optimized
matrices with the IEEE 802.22 WRAN standard.
 Suggesting a differentiated metaheuristic approach of
IWO for achieving better efficiency in optimization
by mapping from an entirely different electrical
domain to the betterment of wireless domain.
The course of the paper is detailed as follows. System model approaches [3][4] are generated in the form of fixed sequence
is presented in Section II. The analysis of the extended data transition matrix 𝑅 and probabilistic sequence transition
delivery time for non-identical channels case is developed in matrix 𝑅 , and minimized for extended data delivery time.
Section III. The extended balancing model is described in 𝑠, 𝑠, ⋯ 𝑠,
Section IV. Problem formulation algorithm and its techniques 𝑅 = 𝑠 , 𝑠 , ⋯ 𝑠 , (2)
are presented in Section V. Numerical results are explained in 𝑠 , 𝑠 , ⋯ 𝑠 ,
Section VI. Finally, concluding remarks of outputs and
suggestions for future work are provided in Section VII. 𝑟
( )
𝑟
( )
… 𝑟
( )

( ) ( ) ( )
II. SYSTEM MODEL 𝑅 = 𝑟 𝑟 … 𝑟 (3)
( ) ( ) ( )
In this division, some of our model assumptions are 𝑟 𝑟 ⋯ 𝑟
introduced. Firstly, a time slotted system is assumed, where wherein 𝑠 , is the target channel of a SU of default channel
the SU senses the current channel at the beginning of each 𝜂 after the ith interruption, the total allowable number of
time slot for the presence of a PU. The SU transmits its data interruptions before the connection is dropped is denoted by
only if the channel is sensed to be idle. Sensing is assumed to 𝜂 . The probability of choosing channel 𝑘 for a SU of
be perfect hereby such that the sensing errors of missed ( )
detection and false alarm are neglected as in [3], [5], [7]. default channel 𝜂 is 𝑟 , 1 ≤ 𝑘 ; 𝜂 ≤ 𝑀 , and 𝑀 is the total
Any channel can be modelled using a pre-emptive resume number of channels.
priority (PRP)M/M/1 queueing model [3]. However, we are
III. ANALYSIS OF THE EXTENDED DATA DELIVERY
proposing the extension of these concepts for a more general
TIME
case of non-identical channels, where the service rates vary.
Inter-arrival and service times are assumed to be independent In this subsegment, the extended data delivery time E[T]
and exponentially changing with rates 𝜆 and µ
( ) ( )
for (most important performance metric) is attained for the
( ) ( ) general case of non-identical channels [11]. SU parameterizes
secondary user and 𝜆 and µ for primary user at channel with a default channel 𝜂 and initial service time requirement
1≤ 𝑘 ≤ 𝑀 ; where 𝑀 is the total number of channels. With ( )
𝑋 . The actual service time spent by SU at default channel
PRP M/M/1 model two queues are assumed, a higher priority ( )
queue for the PUs and a lower priority queue for the SUs. This (before being interrupted by PU) is denoted by 𝜑 , .The
gives PUs the liberty to always pre-empt the SUs via FCFS residual service time after the first interruption (i=1) [11] is
discipline. The interrupted SU’s transmission is resumed after ( ,ƞ )
denoted by ɸ ,ƞ . In an overview, let 𝜑 , be the actual
( , )
the connection is restored. This hereby facilitates a better
transmission without data loss. In our work, the (PRP) M/M/1 service time spent at channel 𝑠 , . Due to non-identical
queueing network model is employed as in Fig.1. The M/M/1 channels assumption of the present model, the residual service
is a basic mathematical model [13] where the users arrive time is scaled after the ith interruption by the ratio
( )
according to a Poisson process and the processing times or to get the service time requirement at the next
(
service times of the users are made independent and
identically exponentially distributed. (
channel which is denoted by ɸ ,ƞ ,ƞ . [11]To evaluate the
)

performance in non-identical channels, both the actual service

time and delay due to the interruptions have to be
accommodated in our calculation. Therefore, overall
expectation of the extended data delivery time 𝑇 ( ) for a SU
of default channel 𝜂 can be evaluated in general using the
following formula:
𝐸 𝑇 (ƞ ) = 𝐸 𝑆 (ƞ ) + 𝐸 𝐷(ƞ ) (4)
where 𝐷 ( ) represents the delay caused by PUs’ interruptions
to the SU’s transmission. We analyzed the extended data
Fig. 1: Pre-emptive Resume Priority (PRP)M/M/1 queueing model
delivery time for the Probabilistic Sequence Approach [11]
The tasks are carried out in line with the FCFS. A definite and and attained the actual service time which is given as:
necessary condition: (ƞ )
𝐸 𝑆( )
=∑ (ƞ ) (ƞ ) +𝑛∑ ( ) ( ) ×
𝜌= <1 (1)
since, otherwise the queue length will explode. (PRP) M/M/1 [𝑃 (𝑁 = 𝑛)] (5)
queueing network model [13] is chosen because it has no
population size limitations and fits our domain aptly. A For optimization of probabilistic approach sequence in target
switching block “S” is employed that decides target channel channel selection of IWO, 𝑠 , will not be fixed. It will be
selection based on fixed or probabilistic sequence associated chosen from any channel 1 ≤ 𝑘 ≤ 𝑀 with probability 𝑟
(ƞ )
.
with each SU. Both fixed and the probabilistic sequence Hence, after each interruption, [11] we conclude that:
 𝑟
(ƞ ) identical channels, where the total service rate of the channel
𝐸 ɸ ,ƞ |𝑁 = 𝑛 = ( ) ( )
,1 ≤ 𝑖 ≤ 𝑛 (6) will be directly proportional to the probability of selecting a
𝜆 +𝜇 certain channel 𝑘 . Thereby, the new proposed formula is:
Undertaking the idle period case (i=0) of PU at default ( ) ( )

channel 𝜂 , we get; 𝐿𝐵(𝑘𝑡) = 𝐶 × ( ) ( ) (15)

(ƞ ) 1
𝐸 ɸ ,ƞ |𝑁 = 𝑛 = (ƞ ) (ƞ )
(7) where normalization constant is denoted by C, determined by
𝜆 +𝜇 the relation:
Similarly, as the number of interruptions increase, the values ( ) ( )

can be loaded onto the generalized equation [11] as: ∑ 𝐿𝐵(𝑘𝑡) = ∑ 𝐶× ( ) ( ) =1 (16)
(ƞ )
𝐸 𝑆 (ƞ ) |𝑁 = 𝑛 = 𝐸 ɸ ,ƞ 𝑁 = 𝑛| + 𝐸 ɸ ,ƞ,ƞ |𝑁 = 𝑛 + ⋯ + The mentioned formula in (15) is based on the following:
,ƞ
𝐸 ɸ ,ƞ |𝑁 = 𝑛 (8)  The total arrival load will be inversely proportional to
the probability of choosing the target channel for load
After loading the values and compiling common terms for balancing. To control the traffic flow from heavily-
ease, we achieve: loaded channels to lightly-loaded channels an
𝐸 𝑆 (ƞ ) = ∑ 𝐸 𝑆 (ƞ ) |𝑁 = 𝑛 × Pr(𝑁 = 𝑛) (9) exponent r (the order) is added.
Substituting (7) and (6) into (8) and (9) we get the formula in  The probability of choosing the target channel will be
(5) of probabilistic approach. Irrespective of the channel case, directly proportional to the total service rate of the
the delay due to PUs interruptions 𝐸 𝐷(ƞ ) is unaffected and channel for the case of non-identical channels.
has already been taken into consideration. From [3], we get;
V. OPTIMIZATION PROBLEM FORMULATION AND
𝐸 𝐷(ƞ ) = ∑ ∑ 𝐸 𝐷 ( ,ƞ ) × Pr (𝑁 = 𝑛) (10)
SOLUTION TECHNIQUES
Substituting the individual terms in (4), we get
(ƞ ) In this section, the main objective is to observe the structure of
(ƞ )
𝐸 𝑇 =∑ (ƞ ) (ƞ ) + 𝑛 ∑ × fixed sequence transition matrix (𝑅 ) and the probabilistic
transition matrix (𝑅 ) for achieving minimum extended
[𝑃𝑟(𝑁 = 𝑛)] + ∑ (∑ 𝐸[𝐷 ]) × Pr (𝑁 = 𝑛) (11) data delivery time.

where, A. Problem Formulation for The Fixed Sequence Proactive

(ƞ ) (ƞ ) (ƞ ) () Approach
∑ 𝐸[𝐷 ] = 𝑟ƞ 𝐸 𝑌 +∑ ƞ 𝑟 𝐸 𝑊 +
The objective here is to find the optimal fixed sequence
(ƞ ) (ƞ ) ()
𝑡 + (𝑛 − 1) ∑ 𝑟 𝑟 𝐸 𝑌 + transition matrix 𝑅 with minimum extended data delivery
∑ 𝑟
(ƞ )
𝐸 𝑊
( )
+𝑡 (12) time 𝐸[𝑇 ] given by:
( )
( )
The equation in (11) is our characteristic equation for which 𝐸[𝑇 ]=∑
∑ ×
×𝐸 𝑇 (17)
invasive weed optimization is being carried out in our study. The optimization problem becomes:
IV. THE EXTENDED BALANCING MODEL 𝑚𝑖𝑛 = 𝐸 𝑇 (18)
( ) ( )
In this section, load balancing model is introduced to include subject to: i) 0< 𝜌 <1, where 𝜌 is the busy probability of
the effects of non-identical channels. A formula of (𝐿𝐵(𝑘𝑡)) any channel 𝑘 , for 1 ≤ 𝑘 ≤ 𝑀 ; ii) 𝑠 , are all integers where
[4] to achieve load balancing by generating the transition 1≤ 𝑠 , ≤ 𝑀 for all i and η, 1 ≤ i ≤ 𝑛 and 1≤ 𝜂 ≤ 𝑀 . The
probability matrix is: parameters 𝜆 , µ , 𝜆 , µ , 𝑛 , r, 𝑡 , and 𝑀 are set
according to the testing network while optimizing the matrix
𝐿𝐵(𝑘𝑡) = 𝐶 × ( ) ( ) (13) 𝑅 . The discrete optimization problem is solved using
where normalization constant is denoted by C and is mixed-integer Genetic algorithm [10], however, it exhibits
determined by the relation: some unavoidable trade-offs that ignites the need of a multi-
dimensional algorithm for optimization – IWO.
∑ 𝐿𝐵(𝑘𝑡) = ∑ 𝐶× ( ) ( ) =1 (14) B. Problem Formulation for the Probabilistic Proactive
Here, r is an important factor that indicates order of direction Approach
of the traffic flow from heavily loaded channels to lightly The objective here is to find the optimal probabilistic
loaded channels. As the order increases, more traffic flow is transition matrix 𝑅 with minimum extended data delivery
directed from heavily loaded channels to lightly loaded 𝐸[𝑇 ]given by:
( )
channels. Furthermore, in the case of low loads, it led to lower 𝐸[𝑇 ]=∑ ×𝐸 𝑇
( )
(19)
extended data delivery time. In identical channels, the ∑ ×

probability of choosing a certain channel 𝑘 was inversely The optimization problem then aims to becoming:
proportional to the total load into the channel. However, 𝑚𝑖𝑛 = {𝐸[𝑇 ]} (20)
modifications are required to the formula for the case of non- subject to:
 1) 0< 𝜌( ) <1, where 𝜌( ) is the busy probability of any
channel 𝑘 , for 1 ≤ 𝑘 ≤ 𝑀 .
(ƞ )
2) ∑ 𝑟 =1 (21)
The parameters 𝜆 , µ , 𝜆 , µ , 𝑛 , r, 𝑡 , and 𝑀 are set
adhering to the testing network case while optimizing the
matrix 𝑅 . The decision variables are chosen as per the
relative preference of a certain channel compared to other
channels and 𝑅 is then obtained by normalizing each
column w.r.t. its sum. PSO is used for real-valued and
continuous functionality problems, however, IWO is more
efficient as it is derivative-free real parameter bio-inspired
optimization technique. Weeds are plants, whose invasive
habits pose a major threat to the cultivated plants and thus,
capturing their properties leads to a powerful optimization
algorithm. IWO mimics robustness, adaptation and random
nature of these weeds in an effective way. The major key
phrases used in IWO are as follows:
Fig. 2: Invasive Weed Optimization Flow Chart
I. Seeds – these are the finite values assigned to all units in the
optimization problem with some limiting conditions applied. 4) Competitive exclusion: a process for plants without
II. Plants –a stage in IWO where the seeds after germination offspring resulting in competition between plants for
grow into plants, and further continue to produce seeds and limiting the total in a colony. After significant iterations,
work in a cycle, until evaluation. the total number of plants reaches a maximum 𝑝 , and
III. Fitness value –a legitimizing parameter which indicates hereafter plant elimination with poor fitness commences.
the wellness of our optimized solution. Elimination mechanism proceeds when maximum no. of
IV. Field – Most probable and feasible area where the solution weeds is reached, thereafter, is allowed to produce seeds.
or search is lying. Chronological proceeding order for IWO Seeds are allowed to spread over the search area. As
implementation [14] can visually understood from Fig.2 as: seeds have found their specific positions, they are ranked
1) Initializing a population: A finite number of seeds (initial together with their parents. Here, weeds with lower
solutions) are being scattered over the search area of fitness are eliminated allowing ones with better fitness to
dimension ‘D’, with different search positions. survive and replicate. This population control mechanism
2) Reproduction: Every user/seed outgrows into a flowering is also applied to their offspring at the end of the run-in
plant, further producing seeds depending upon its fitness order to realize competitive exclusion.
level. The evolutionary algorithm incorporates the use of
fitness function to solve the optimization problems. VI. NUMERICAL RESULTS
Decision made: high fitness is feasible (decides the In this section, the results of applying the novel meta-heuristic
chance to survive and reproduce) and low fitness is IWO Algorithm to non-identical channels of cognitive radio
infeasible candidates. However, evolutionary algorithms networks are presented and compared to IEEE 802.22 WRAN
follow probabilistic recurrent approach, there is a along with random selection strategy. A five-channel
possibility that some of infeasible candidates carry more ( )
cognitive radio network with µ = 0.05 for 1 ≤ 𝑘 ≤ 5, 𝑡 =1,
important information than the feasible individuals.
𝑛 =10 and r=6 is considered. 𝜆 is the same for all
Therefore, IWO is proposed to include infeasible
individuals to survive and continue their hierarchy. channels and is varied between 0.01 and 0.032. For non-
( ) ( ) ( ) ( ) ( )
3) Spatial dispersal: The seeds generated after reproduction homogeneous loads, ( 𝜆 𝜆 𝜆 𝜆 ) 𝜆 )= (0.007,
are randomly distributed over dimension ‘D’ using 0.02, 0.035, 0.03, 0.01). However, for the homogeneous loads,
( )
normally distributed random numbers. However, 𝜆 = 0.025 for 1 ≤ 𝑘 ≤ 5. Moreover, for the non-identical
standard deviation (SD) ‘σ’ will reduce from 𝜎 to channels case, ( µ
( )
µ
( )
µ
( ) ( ) ( )
µ ) µ )= (0.1; 0.09; 0.15;
𝜎 after each iteration/generation. A nonlinear ( )
0.12; 0.2). Finally, for the identical channels case, µ =0.1
alteration has shown satisfactory performance in the for 1 ≤ 𝑘 ≤ 5. The values of 𝑛 and r are chosen based on
simulations, which is defined by the Eqn: the obtained results of a previous study [4][3] for comparison.
(𝑖𝑡𝑒𝑟 − 𝑖𝑡𝑒𝑟) GA, PSO and IWO parameters are summarized in Table I,
𝜎 = 𝜎 −𝜎 +𝜎 (22) Table II, and Table III respectively.
(𝑖𝑡𝑒𝑟 )
here 𝑖𝑡𝑒𝑟 is the maximum number of iterations, 𝜎 is the TABLE I: GA parameters
SD, and 𝑛 is the nonlinear modulation index=3. This Number of generations 20000 Population size 2000
nonlinear alteration ensures that the probability of dropping a Stalled generations limit 500 Elite count 100
seed in a distant area decreases nonlinearly at each step
Crossover probability (pc) 0.9 Stalled time limit ∞
resulting in elimination of inappropriate plants.
 TABLE II: PSO parameters (𝜆 ) and different secondary loads (𝜆 ). It is observed that,
Number of iterations 20000 Number of particles 2000 IWO optimized both probabilistic and fixed sequence
(l) (u)
approaches have similar performance. The optimized solution
Stalled iterations limit 500 [pos , pos ] [0.0001,100]
is termed as 𝑇 . It is clear that:
wmin 0.3 wmax 1
 Optimized solutions for Proactive approach (GA followed
Cognitive coefficient 1 Social coefficient 1 by PSO) and IWO (both fixed and probabilistic) in all
network cases converge towards the A-stay standard
TABLE III: IWO parameters
(Fig.6(a) and Fig.6(b)) for high traffic conditions which
Number of iterations 20000 seedsmin, seedsmax [0,2]
leaves the user with diverse number of options to choose
Initial value of Final Value of from as per desired network conditions.
1.5 0.0001
standard deviation Standard deviation
(l) (u)
 The higher the secondary load with time, earlier the
[iwo , iwo ] [0.0001,100] Max weed population 2000
convergence is observed to the A-stay approach. Staying
Variance reduction Number of decision
exponent
3
variables
2 at the default channel relieves SU from long queues and
reduces delay caused due to waiting and processing time
A. Analytical Model Validation as it will stay at the head start of his very own queue and
The simulation is carried out using MATLAB/SIMULINK only wait for the PU to finish its transmission.
2016a for a cognitive radio network. The simulation results in  In IWO for homogenous loads in non-identical channel
Fig.3 show the general case of non-identical channels with case (Fig.4(a)), there is convergence between Ext.
non-homogeneous and homogenous loads in cognitive Balanced model and A-stay for high traffic conditions.
networks. These results authenticate and validate our D. Performance Evaluation for Comparative analysis
analytical model and its assumptions correctly. The
implementation of IWO over different domains: the fixed Fig.5 depicts the extended data delivery time performance
sequence transition matrix 𝑅 to achieve optimization of comparison between different metaheuristic approaches to
obtain optimised results for target channel sequence selection.
fixed sequence proactive approach and probabilistic sequence
Both homogenous load case (Fig.5(a)) and non-homogeneous
transition matrix 𝑅 to achieve optimization of probabilistic
load case(Fig.5(b)) have been considered for simplicity. In our
sequence proactive approach. The standards of IEEE 802.22 analysis, IWO algorithm for probabilistic sequence approach
WRAN have been included for performance comparison [15]. determines GA and PSO [12] have also been included to bring
B. Performance Evaluation for Low Traffic Networks comparison. IWO outperforms all other techniques (Fig.5) and
From Fig.3 and Fig.4, we examined extended data delivery is the optimal optimisation technique compared to others. A-
time performance of target channel selection approaches stay and A-change standards [15] of IEEE 802.22 WRAN are
analysed and their performance is compared to our results of
(fixed and probabilistic) for low primary load traffic (𝜆 ). It IWO, where A-stay shines to be better than A-change. A-
can be made evident that: change and random selection strategy converge in the case of
 IWO algorithm has an optimal solution compared to low traffic conditions. In non-homogenous load case
the other alternatives. IEEE 802.22 illustrates better results (Fig.5(b)), A-stay and Ext. Load balanced model intersect in
only in the case of homogeneous loads and identical channels very low traffic conditions.
[15], however, in the case of non-identical channels the results
are disassembled. In the non-identical channels, it is always VII. CONCLUSION
better to stay [3]. It is also seen that optimization on the load In this paper, an analytical model for non-identical channel
balancing model intersects with random selection (Fig.4(a)) case in cognitive radio networks is proposed. Using the (PRP)
for homogeneous loads and non-identical channels. M/M/1 queueing network model, the extended data delivery
 Results for both IWO optimized probabilistic and time E[T] of the SUs is considered for analysis. The proposed
fixed sequence approaches (Fig.4(a) and Fig.4(b)) lead model can evaluate E[T] for any fixed or probabilistic
ultimately to close adjacent results. Probabilistic sequence transition matrices using nature inspired meta-heuristic
approach has minutely better balancing characteristics when approaches: GA, PSO and IWO which include homogeneous
the transition matrix is selected precisely [4]. Similar or non-homogeneous loads with non-identical channels.
performance can be attributed to a possibility of reaching out Furthermore, simulation results are introduced to validate the
to any finite target sequence selection without restrictions. proposed work. Target channel selection approaches are
 Observations from Fig.4(a) and Fig.4(b) declare that compared with each other on the basis of the performance
in low traffic conditions of primary user, there is a competitive exhibited by the optimized matrices. Based on the statistical
dominance between A-stay, IWO fixed approach, IWO results, we know that 𝑅 and 𝑅 on optimization
probabilistic approach because they are overlapping. provide similar results, forcing a fast hybrid target channel
C. Performance Evaluation for High Traffic Networks selection approach to be proposed.
Fig.4 and Fig.6 show the extended data delivery time
performance for a comparatively higher primary load traffic

Fig. 3: Non-identical Channel Performance for Average Extended Data
Delivery Rate of SU with average inter arrival rate of PU for homogeneous
loads (left Fig 3(a)) and non-homogenous loads (right Fig 3(b)) using
metaheuristic approaches: Genetic Algorithm and Particle Swarm
optimisation (fixed and probabilistic) approaches.
Fig. 4: Performing IWO approach for non-identical channel case considering
homogenous loads (left Fig4(a)) and non-homogenous loads (right Fig 4(b)) to
attain relation between Average extended data delivery rate of SU with
average inter-arrival rate of PU.
Fig. 5: Extended data delivery time performance comparison with inter-arrival
time of PU for non-identical channel case with homogenous loads (left Fig
5(a)) and non-homogenous loads (right Fig 5(b)). IWO (for both fixed and
probabilistic) provides more optimized results followed by PSO and GA.
Fig. 6(a) left: Comparative analysis with A-stay standard at different
secondary loads at high traffic in the case GA+PSO optimization. Fig. 6(b)
right: Comparative analysis to always stay standard at different secondary
loads at high traffic in the case IWO.
The comparison between IEEE standard and IWO approach
showed promising results. This work can be extended in future
research by considering a general service time distribution
model by using the IWO for the case of hybrid selection
(adaptive to fixed and probabilistic). Other formulae could be
modified for the hybrid approach and attain further
diminishment of extended data delivery time. Research
findings indicate the advantage of new formulae being more
optimized and leading to significant increase in the network
capacity for more SUs, especially with strict delay constraints
parameters.
REFERENCES
[1] S. Zahed, I. Awan, and A. Cullen, “Analytical modeling for
spectrum handoff decision in cognitive radio networks,” Simulation
Modelling Practice and Theory, vol. 38, pp. 98 – 114, 2013.
[2] M. H. Rehmani, A. C. Viana, H. Khalife, and S. Fdida, “Surf: A
distributed channel selection strategy for data dissemination in multi-
hop cognitive radio networks,” Computer Communications, vol. 36,
no. 10-11, pp. 1172 – 1185, 2013.
[3] L.-C. Wang, C.-W. Wang, and C.-J. Chang, “Modeling and
analysis for spectrum handoffs in cognitive radio networks,” IEEE
Transactions on Mobile Computing, vol. 11, September 2012.
[4] A. Tayel and S. Rabia, “Load balancing probabilistic spectrum
handoff for cognitive radio networks,” in International Symposium
on Performance Evaluation of Computer and Telecommunication
Systems (SPECTS 2015), July 2015, pp. 587–594.
[5] L.-C. Wang, C.-W. Wang, and C.-J. Chang, “Optimal target
channel sequence design for multiple spectrum handoffs in cognitive
radio networks,” IEEE Transactions on Communications, vol. 60, no.
9, pp. 2444–2455, September 2012.
[6] C.-W. Wang and L.-C. Wang, “Analysis of reactive spectrum
handoff in cognitive radio networks,” IEEE Journal on Selected
Areas in Communications, vol. 30, pp. 2016–2028, November 2012.
[7] F. Sheikholeslami, M. Nasiri-Kenari, and F. Ashtiani, “Optimal
probabilistic initial and target channel selection for spectrum handoff
in cognitive radio networks,” IEEE Transactions on Wireless
Communications, vol. 14, no. 1, pp. 570–584, January 2015.
[8] L.-C. Wang, C.-W. Wang, and F. Adachi, “Load-balancing
spectrum decision for cognitive radio networks,” IEEE Journal on
Selected Areas in Communications, vol. 29, pp. 757–769, April 2011.
[9] A. Zakariya, A. Tayel, and S. Rabia, “Comments on ”optimal
target channel sequence design for multiple spectrum handoffs in
cognitive radio networks”, IEEE Transactions on Communications,
vol. 63, no. 8, pp. 3021–3024, Aug 2015.
[10] K. Deep, K. P. Singh, M. Kansal, and C. Mohan, “A real coded
genetic algorithm for solving integer and mixed integer optimization
problems,” Applied Mathematics and Computation, vol. 212, 2009.
[11] Ahmed F. Tayel, Sherif I. Rabia, and Yasmine Abouelseoud, “
An Optimized Hybrid Approach for Spectrum Handoff in Cognitive
Radio Networks with Non-Identical Channels” IEEE
TRANSACTIONS ON COMMUNICATIONS, Volume 64, Nov 2016.
[12] Y. Song and J. Xie, “Prospect: A proactive spectrum handoff
framework for cognitive radio ad hoc networks without common
control channel,” IEEE Transactions on Mobile Computing, vol. 11,
no. 7, pp. 1127–1139, July 2012.
[13] Mina Fahimi, Abdorasoul Ghasemi, “Analysis of the PRP
M/G/1 queuing system for cognitive radio networks with handoff
management,”IEEE Journal of ICEE.
[14] A.R. Mehrabian, C. Lucas,” A novel numerical optimization
algorithm inspired from weed Colonization” Elsevier Journal on
Ecological Informatics Volume 1, December 2006.
[15] Carlos Cordeiro, Kiran Challapali, Dagnachew Birru, Sai
Shankar N,”IEEE 802.22: An Introduction to the First Wireless
Standard based on Cognitive Radios” JOURNAL OF
COMMUNICATIONS, VOL. 1, NO. 1, APRIL 2006.