# Fuzzy Based PC-PUSH in CR-MANETs

Authors: S. Nejatian; S. K. Syed Yusof; N. M. Abdul Lattif; V. Rezaie; V. Asadpour
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

In cognitive radio (CR), the secondary user (SU) needs to hand off its ongoing communication to an idle channel in order to avoid interference to the primary user (PU). Spectrum hand off issue becomes challenging in CR mobile ad hoc networks (CR-MANETs) because of the uncertainty in spectrum availability, broad range of spectrum bands and lack of central entity. The purpose of this study is to design a unified spectrum handoff (USH) scheme for CR-MANETs that considers the spectrum heterogeneity and its availability over time and space. A local flow hand off is performed when spectrum hand off cannot be carried out due to the SUs mobility. To improve further USH, preemptive unified spectrum handoff (PUSH) algorithm is proposed in which two different preemptive hand off threshold regions are defined. The PUSH algorithm also predicts the cognitive link availability considering the PU interference boundary. Although the PUSH scheme improves the hand off performance, the number of spectrum hand offs due to the PU activity should be reduced in this scheme. Therefore, the PC-PUSH (Power Controller-PUSH) scheme is proposed in which the fuzzy logic is used to improve the PUSH in terms of the number of spectrum handoffs because of the PU activity. The PC-PUSH decreases the interference to the PUs, while reducing the number of spectrum handoffs. The results show that the proposed scheme improves the link maintenance probability, decreases the hand off delay, and reduces the number of spectrum handoffs.


---

## Body

## 1. Introduction

Over the last few decades, the huge success of wireless applications has caused some spectrum bands being heavily used, especially unlicensed bands, such as ISM bands. This can be attributed to interference and poor network performance. On the other hand, recent studies by the Federal Communications Commission (FCC) have shown that a large amount of the licensed spectrum bands allocated through static assignment policies remains underutilized and inefficient. In fact, researchers have concluded that the traditional fixed spectrum allocation approach cannot continue to efficiently regulate the spectrum access. To address this situation, wireless devices operating in unlicensed bands can dynamically identify currently unused licensed spectrum bands for data communications and opportunistically access the unoccupied spectrum called spectrum holes or white spaces.Cognitive capability with the enabling technology of cognitive radio (CR) allows wireless devices to use the spectrum holes. CR has the capability of completely changing its transmitter parameters (operating spectrum, modulation, and transmission power) based on interactions with the surrounding spectral environment. CR users, called secondary users (SUs) or unlicensed user, sense a wide spectrum range, identify the spectrum holes, and opportunistically access them when primary (or licensed) users (PUs) are idle [1]. PUs have been licensed to use the spectrum band and SUs must access the spectrum in a nonintrusive manner [2].The latest trend in CR research area has seen an extensive research interest in mobile ad hoc networks (MANETs) to improve the spectrum efficiency by novel design techniques that simultaneously address the communication problems through various layers of the protocol stack. Enabling the CR technology in MANETs introduces the cognitive radio mobile ad hoc networks (CR-MANETs).The uncertainty in the availability of spectrum holes is caused by the random appearance of PUs as well as the unpredictability of the SUs demand. The spectrum holes may shift over time and over space. In a CR system, the shifting of spectrum holes can be defined as spectrum mobility, which is cohesive to spectrum handoff. Spectrum handoff refers to the transfer of an ongoing data transmission of a CR user to another available spectrum band. In heterogeneous CR networks, a channel may be available over vast, mutually exclusive spectrum bands that present remarkable heterogeneity in terms of channel transmission range [3].Spectrum handoff is extremely challenging in CR networks, especially in CR-MANETs, because of frequent topologic variations, limited power, limited channel transmission range, bandwidth constraints, and lack of the central controlling entity [4]. On the other hand, the available spectrum bands vary over time and space, while they are distributed nonadjacently over a broad frequency range. In a CR-MANET system, SU mobility and channel heterogeneity lead to performance degradation and frequent spectrum handoff during communication. Hence, the fluctuation of PU activity and the SU mobility in CR-MANETs have made the issue of maintaining optimal routes more complex.Route failure has strong relationship with spectrum handoff. The route failure can be caused by spectrum mobility (PU activity), SU mobility, and channel heterogeneity. According to the failure type, different route recovery strategies need to be applied. Previous works on spectrum handoff in CR-MANETs only consider the effect of PUs activity. Therefore, a unified spectrum handoff (USH) management for CR-MANETs must be proposed that considers the effects of all of the factors mentioned above. In this work, a preemptive unified spectrum handoff (PUSH) method for CR-MANETs is proposed. PUSH considers the effects of mentioned factors on handoff initiation and management. In PUSH, two different preemptive handoff threshold regions were introduced and defined. A preemptive local flow handoff is performed when spectrum handoff cannot be carried out due to the SUs mobility. The PUSH algorithm also predicts the cognitive link availability and estimates the maximum link availability time considering the PU interference boundary. Although the PUSH scheme improves the handoff management scheme performance, the number of spectrum handoffs due to the PU activity should be reduced. Therefore, the PC-PUSH (Power Controller-PUSH) scheme is proposed in which the fuzzy logic is used to improve the performance of the PUSH in terms of the number of spectrum handoffs because of the PU activity.


## 2. Related Works

Song and Xie [5] proposed a proactive spectrum handoff configuration based on statistics of observed channel utilization. The network coordination and rendezvous issues are solved in this spectrum handoff scheme without using a common control channel. The collision among SUs is prevented through a distributed channel determination scheme. Giupponi and Pérez-Neira [6] proposed a fuzzy based spectrum handoff decision-making approach employing two fuzzy logic controllers. Each SU estimates the distances between itself and all the active PUs in the surrounding area using the first fuzzy logic controller. The other fuzzy logic controller determines whether the SU needs to perform a spectrum handoff and, in some cases, power control is used instead of handoff. Duan and Li proposed a spectrum handoff strategy in which the optimal spectrum band is chosen based on a multiplex criterion considering the estimated transmission time, the PU presence probability, and the spectrum availability time [7]. A cooperative spectrum sensing scheme is used to predict the spectrum idleness. A geolocation method is used to perform a spectrum handoff in the space domain. The simulation results indicated that the proposed spectrum handoff scheme outperformed conventional methods in terms of spectrum handoff delay in a per hop basis. However, channel heterogeneity parameters are not considered in the spectrum handoff. In [8], an established route from a source node S to a destination node D is considered. Different scenarios, which lead to the handoff initiation in this route, are also introduced. Considering these events, which are node mobility and spectrum mobility, the authors introduced a conceptual model for unified handoff management in CR-MANETs. Nejatian et al. [9] have characterized the availability of spectrum bands in CR-MANETs. The authors proved that the channel heterogeneity must be considered in terms of transmission range, because it increases the blocking probability of spectrum handoff. Based on their findings, a unified system, which considers the spectrum mobility in time and space domain as well as topology changing, must be investigated.


## 3. Unified Spectrum Handoff (USH) Scheme

In this section, first, the heterogeneous network architecture is described considering the specifics of the SUs, characteristics of the PUs, and the channel aspects of the network. Then, the USH scheme is introduced that considers the spectrum-aware handoff management based on the interactions between network layer and the physical layer. The proposed scheme is integrated with an algorithm to identify appropriate spectrum bands and calculate the channel availability time based on the channel qualities, the spectrum, and the node mobility.


### 3.1. System Description

It is assumed that the SU is equipped with multiradio, multichannel, and common control channel signaling features. The maximum number of channels accessible by the SU at a time isC. The C channels are defined by the set of T, which belong to the PU network. These channels are classified into different L types according to their different transmission ranges. The set of each type is shown by T
l in which T
l
=
C
l, which denotes the total number of channels for type l and C
=
C
1
+
C
2
+
⋯
+
C
L. Depending on the PU activity, any SU can access up to C channels at any position in time. The number of detected channels of type l by a node is c
l, and the total number of detected channels at a node is c
=
c
1
+
c
2
+
⋯
+
c
L. The transmission range of channels of type l is R
l.


### 3.2. Analytical Modeling of the USH Scheme

To propose the unified spectrum handoff management, different scenarios are introduced which cause spectrum handoff initiation through an established route in a CR-MANET. Suppose that a route from a source nodeS to the destination node D has been established. There are three different scenarios that initiate the spectrum handoff in this route.Assume a pair of SU transmitter-receiver, which transmits and receives using communication channel. The activity of the PU in the neighbourhood of these nodes may cause the link between them to be failed. This route failure occurs once the PU starts its transmission or when one of the transmitter-receiver nodes enters the coverage area of the PU.The mobility of the CR user can also lead to spectrum handoff due to spectrum heterogeneity and various channel transmission ranges. Again, assume a pair of SU transmitter-receiver, which transmits and receives using communication channel of typel, with transmission distance between them of less than R
l. When the SUs move and their distance exceeds R
l, the nodes must change and select another channel opportunistically. In this case, in order to support the communication link, the new chosen channel must have a transmission range longer than R
l.In some cases, route failure occurs when either transmitter node or receiver node moves such that no channel can support their transmission. Before the route failure occurs, local flow handoff is performed. A local flow handoff can be from transmitter node to an intermediate node and finally joining receiver node. In this scenario, the unified local routing and spectrum handoff management system tries to solve the problem by finding a node as an intermediate node within the neighbouring area of the damaged links.To analytically model the USH, the parameterp is defined as the probability of single channel availability at a node by considering the PU activity with an alternating renewal two-state birth-death process with a death rate α and a birth rate β. The P
car
,
c is defined as the probability of the existence of at least one idle channel for each hop in a route as follows [9]:
(1)
P
car
,
c
=
1
-
∏
k
=
1
c
-
∑
j
=
0
i
-
1
‍
c
j
‍
1
-
α
k
α
k
+
β
k
2
∑
i
=
1
L
‍
exp
⁡
(
-
λ
π
R
i
-
1
2
/
2
)
-
exp
⁡
(
-
λ
π
R
i
2
/
2
)
1
-
exp
⁡
(
-
N
/
2
)
×
1
-
∏
k
=
1
c
-
∑
j
=
0
i
-
1
‍
c
j
‍
1
-
α
k
α
k
+
β
k
2
1
-
∏
k
=
1
c
-
∑
j
=
0
i
-
1
‍
c
j
‍
1
-
α
k
α
k
+
β
k
2
n
-
1
.
Once the channel quality declines or PER (packet error rate) increases, the probability of successful packet transmission rate is decreased. Therefore, the SU decides to change the channel. Considering P
E
i as the PER of channel of type i and (1), the probability of successful packet routing in a route or between n nodes is deduced to be
(2)
p
spr
,
c
=
∑
i
=
1
L
‍
P
car
,
c
(
1
-
P
E
i
)
.
The probability of successful packet transmission in a hop or between two nodes is also found as
(3)
p
spt
,
c
=
p
spr
,
c
|
n
=
2
.
The parameter P
E
i signifies the rate of dropped packets because of the variable channel conditions caused by factors such as fading and shadowing. The probability of unsuccessful packet transmission in a hop or between two nodes can be stated as
(4)
p
uspt
,
c
=
1
-
p
spt
,
c
.
To calculate the probability distribution of spectrum handoff and also model the spectrum handoff initiation in CR-MANETs, the position case D
l
-
1
l is defined as the case in which R
l
-
1
<
d
<
R
l, where d is the length of the hop. Hereafter, for the sake of indexing convenience, the position case D
l
-
1
l is referred to as D
l throughout the thesis.Figure1 shows different Markov chains for spectrum handoff modelling based on the length of the hops. P, which is a stochastic matrix and describes the Markov chain over the finite state space, is written as follows:
(5)
P
=
P
T
11
⋯
P
T
1
L
-
1
P
T
1
L
⋮
⋮
⋮
⋮
⋯
P
T
i
k
⋯
P
T
i
L
⋮
⋮
⋮
⋮
P
T
L
1
⋯
P
T
L
L
-
1
P
T
L
L
.
Here, the parameter P
T
i
k illustrates the probability of moving channel transition state from state i to state k. The Markov chains have different numbers of states based on the different position cases D
l. When the length of the hop is less than R
1, or when the spectrum handoff occurs in the position case D
1, the two nodes involved in the current hop can select one of the available channels of any L types. In the position case D
1, the Markov chain is as shown in Figure 1(a). In the case D
2, the nodes involved in spectrum handoff can select one channel among available channels from type k, in which k
≠
1, as shown in Figure 1(b). When the distance between the involved nodes in the spectrum handoff is according to position case D
L, the nodes can only select one channel among available channels of type L, as shown in Figure 1(c). The other situations can be determined based on the claims above.Markov chains for spectrum handoff modeling based on the SUs distance.
(a)
CaseD
1
(b)
CaseD
2
(c)
CaseD
LSuppose that two nodes are communicating in a channel of typek. There are two different conditions where nodes continue their communication in the current spectrum pool. These two conditions, in the position case of D
l, are as follows.(i)
The packet transmission is successful in the current channel of typek.
(ii)
The packet transmission is not successful in the current channel of typek but only successful on another channel of spectrum pool k.Thus, the probability that the involved nodes in this hop do not switch their channel type, P
T
k
k, is calculated as
(6)
P
T
k
k
,
D
l
=
p
spt
,
c
k
+
∏
j
=
1
,
j
≠
k
L
‍
p
uspt
,
c
j
.
There are also two conditions where two nodes, which are communicating on a channel of type m, switch their channel type to another channel of type k such that k
∈
1,2
,
…
,
L
k
≠
m. These two conditions, in the position case D
l, are (i)
unsuccessful packet transmission in a channel of typem, but only successful transmission in channel of type k;
(ii)
unsuccessful packet transmission in a channel of typem, but successful transmission in channel type sets:
(7)
S
D
l
⊆
T
,
S
D
l
=
L
D
l
<
L
.Based on the Markov chains, there are many possible channel type sets forS
D
l. The channel of type j can be chosen with an identical probability among the available channel types in the set of S
D
l. Based on this explanation, the probability that the involved nodes in this hop switch their channel type, P
T
m
k, is
(8)
P
T
m
k
,
D
l
=
p
uspt
,
c
m
p
spt
,
c
k
∏
j
=
1
,
j
≠
m
,
k
L
‍
p
uspt
,
c
j
+
p
uspt
,
c
m
∑
S
D
l
⊆
T
∏
j
=
1,2
,
…
,
i
|
T
j
∈
S
D
l
,
j
≠
m
‍
p
sup
⁡
,
c
j
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
×
∏
j
=
1,2
,
…
,
i
|
T
j
∉
S
D
l
,
j
≠
m
‍
p
uspt
,
c
j
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
×
S
D
l
-
1
∏
j
=
1,2
,
…
,
i
|
T
j
∈
S
D
l
,
j
≠
m
‍
p
s
u
p
,
c
j
∑
S
D
l
⊆
T
∏
j
=
1,2
,
…
,
i
|
T
j
∈
S
D
l
,
j
≠
m
‍
p
s
u
p
,
c
j
.
The row vector Π
D
l
P, which is composed of Π
D
l
P
T
i, demonstrates the steady state probability for P
D
l considering different hop lengths. The value of Π
D
l
P
T
i is calculated using the equations:
(9)
Π
D
l
P
×
P
D
l
=
Π
D
l
P
,
∑
i
=
1
L
‍
Π
D
l
P
T
i
=
1
.
Ultimately, the steady state probabilities for various hop lengths for channel type i are calculated as below:
(10)
Π
P
T
i
=
∑
l
=
1
L
‍
Pr
⁡
R
l
-
1
<
d
<
R
l
Π
D
l
P
T
i
,
where Pr
⁡
R
l
-
1
<
d
<
R
l is calculated as [10]
(11)
Pr
⁡
R
l
-
1
<
d
<
R
l
=
F
d
R
l
-
F
d
(
R
l
-
1
)
=
exp
⁡
(
-
λ
π
R
l
-
1
2
/
2
)
-
exp
⁡
(
-
λ
π
R
l
2
/
2
)
1
-
exp
⁡
(
-
N
/
2
)
.The spectrum handoff procedure happens when the current channel can not support the data transmission. However, the spectrum handoff will not be initiated on any of the available channels due to other circumstances such as low channel transmission range as this can lead to transmission failure. Therefore, the probability of spectrum handoff can be formulated as(12)
P
SH
=
∑
i
=
1
L
‍
Π
P
T
i
p
uspt
,
c
i
-
∏
j
=
1
L
‍
p
uspt
,
c
j
.
In (12), the term ∑
i
=
1
L
‍
Π
P
T
i
∏
j
=
1
L
‍
p
uspt
,
c
j is the probability that all available channels have unsuccessful packet transmission. In such a case, the troubled nodes do not perform spectrum handoff; they perform local flow handoff. Therefore, the probability of local flow handoff can be expressed as follows:
(13)
P
LH
⁡
=
∑
i
=
1
L
‍
Π
P
T
i
∏
j
=
1
L
‍
p
uspt
,
c
j
.
The probability of successful spectrum handoff (
P
ssh
) depends on the probability of successful packet transmission in a hop, p
spt
,
c. The link maintenance probability (
P
LM
) is defined as the probability that the link is successfully maintained in a hop or between troubled nodes, which is dependent on the probability of channel availability between two nodes. Thus, the link maintenance probability, considering only spectrum handoff, can be written as
(14)
P
LM
,
SH
=
P
SH
×
p
spt
,
c
.
When the link maintenance is not successful, despite performing spectrum handoff, local rerouting is performed. In this case, the probability of link maintenance can be represented as
(15)
P
LM
,
LH
⁡
=
N
-
1
N
1
-
P
LM
,
SH
P
LH
⁡
×
p
spt
,
c
.
Finally, the probability of link maintenance, considering the integration of local routing and spectrum handoff management, can be stated as
(16)
P
LM
,
USH
=
P
LM
,
SH
+
P
LM
,
LH
⁡
.


## 3.1. System Description

It is assumed that the SU is equipped with multiradio, multichannel, and common control channel signaling features. The maximum number of channels accessible by the SU at a time isC. The C channels are defined by the set of T, which belong to the PU network. These channels are classified into different L types according to their different transmission ranges. The set of each type is shown by T
l in which T
l
=
C
l, which denotes the total number of channels for type l and C
=
C
1
+
C
2
+
⋯
+
C
L. Depending on the PU activity, any SU can access up to C channels at any position in time. The number of detected channels of type l by a node is c
l, and the total number of detected channels at a node is c
=
c
1
+
c
2
+
⋯
+
c
L. The transmission range of channels of type l is R
l.


## 3.2. Analytical Modeling of the USH Scheme

To propose the unified spectrum handoff management, different scenarios are introduced which cause spectrum handoff initiation through an established route in a CR-MANET. Suppose that a route from a source nodeS to the destination node D has been established. There are three different scenarios that initiate the spectrum handoff in this route.Assume a pair of SU transmitter-receiver, which transmits and receives using communication channel. The activity of the PU in the neighbourhood of these nodes may cause the link between them to be failed. This route failure occurs once the PU starts its transmission or when one of the transmitter-receiver nodes enters the coverage area of the PU.The mobility of the CR user can also lead to spectrum handoff due to spectrum heterogeneity and various channel transmission ranges. Again, assume a pair of SU transmitter-receiver, which transmits and receives using communication channel of typel, with transmission distance between them of less than R
l. When the SUs move and their distance exceeds R
l, the nodes must change and select another channel opportunistically. In this case, in order to support the communication link, the new chosen channel must have a transmission range longer than R
l.In some cases, route failure occurs when either transmitter node or receiver node moves such that no channel can support their transmission. Before the route failure occurs, local flow handoff is performed. A local flow handoff can be from transmitter node to an intermediate node and finally joining receiver node. In this scenario, the unified local routing and spectrum handoff management system tries to solve the problem by finding a node as an intermediate node within the neighbouring area of the damaged links.To analytically model the USH, the parameterp is defined as the probability of single channel availability at a node by considering the PU activity with an alternating renewal two-state birth-death process with a death rate α and a birth rate β. The P
car
,
c is defined as the probability of the existence of at least one idle channel for each hop in a route as follows [9]:
(1)
P
car
,
c
=
1
-
∏
k
=
1
c
-
∑
j
=
0
i
-
1
‍
c
j
‍
1
-
α
k
α
k
+
β
k
2
∑
i
=
1
L
‍
exp
⁡
(
-
λ
π
R
i
-
1
2
/
2
)
-
exp
⁡
(
-
λ
π
R
i
2
/
2
)
1
-
exp
⁡
(
-
N
/
2
)
×
1
-
∏
k
=
1
c
-
∑
j
=
0
i
-
1
‍
c
j
‍
1
-
α
k
α
k
+
β
k
2
1
-
∏
k
=
1
c
-
∑
j
=
0
i
-
1
‍
c
j
‍
1
-
α
k
α
k
+
β
k
2
n
-
1
.
Once the channel quality declines or PER (packet error rate) increases, the probability of successful packet transmission rate is decreased. Therefore, the SU decides to change the channel. Considering P
E
i as the PER of channel of type i and (1), the probability of successful packet routing in a route or between n nodes is deduced to be
(2)
p
spr
,
c
=
∑
i
=
1
L
‍
P
car
,
c
(
1
-
P
E
i
)
.
The probability of successful packet transmission in a hop or between two nodes is also found as
(3)
p
spt
,
c
=
p
spr
,
c
|
n
=
2
.
The parameter P
E
i signifies the rate of dropped packets because of the variable channel conditions caused by factors such as fading and shadowing. The probability of unsuccessful packet transmission in a hop or between two nodes can be stated as
(4)
p
uspt
,
c
=
1
-
p
spt
,
c
.
To calculate the probability distribution of spectrum handoff and also model the spectrum handoff initiation in CR-MANETs, the position case D
l
-
1
l is defined as the case in which R
l
-
1
<
d
<
R
l, where d is the length of the hop. Hereafter, for the sake of indexing convenience, the position case D
l
-
1
l is referred to as D
l throughout the thesis.Figure1 shows different Markov chains for spectrum handoff modelling based on the length of the hops. P, which is a stochastic matrix and describes the Markov chain over the finite state space, is written as follows:
(5)
P
=
P
T
11
⋯
P
T
1
L
-
1
P
T
1
L
⋮
⋮
⋮
⋮
⋯
P
T
i
k
⋯
P
T
i
L
⋮
⋮
⋮
⋮
P
T
L
1
⋯
P
T
L
L
-
1
P
T
L
L
.
Here, the parameter P
T
i
k illustrates the probability of moving channel transition state from state i to state k. The Markov chains have different numbers of states based on the different position cases D
l. When the length of the hop is less than R
1, or when the spectrum handoff occurs in the position case D
1, the two nodes involved in the current hop can select one of the available channels of any L types. In the position case D
1, the Markov chain is as shown in Figure 1(a). In the case D
2, the nodes involved in spectrum handoff can select one channel among available channels from type k, in which k
≠
1, as shown in Figure 1(b). When the distance between the involved nodes in the spectrum handoff is according to position case D
L, the nodes can only select one channel among available channels of type L, as shown in Figure 1(c). The other situations can be determined based on the claims above.Markov chains for spectrum handoff modeling based on the SUs distance.
(a)
CaseD
1
(b)
CaseD
2
(c)
CaseD
LSuppose that two nodes are communicating in a channel of typek. There are two different conditions where nodes continue their communication in the current spectrum pool. These two conditions, in the position case of D
l, are as follows.(i)
The packet transmission is successful in the current channel of typek.
(ii)
The packet transmission is not successful in the current channel of typek but only successful on another channel of spectrum pool k.Thus, the probability that the involved nodes in this hop do not switch their channel type, P
T
k
k, is calculated as
(6)
P
T
k
k
,
D
l
=
p
spt
,
c
k
+
∏
j
=
1
,
j
≠
k
L
‍
p
uspt
,
c
j
.
There are also two conditions where two nodes, which are communicating on a channel of type m, switch their channel type to another channel of type k such that k
∈
1,2
,
…
,
L
k
≠
m. These two conditions, in the position case D
l, are (i)
unsuccessful packet transmission in a channel of typem, but only successful transmission in channel of type k;
(ii)
unsuccessful packet transmission in a channel of typem, but successful transmission in channel type sets:
(7)
S
D
l
⊆
T
,
S
D
l
=
L
D
l
<
L
.Based on the Markov chains, there are many possible channel type sets forS
D
l. The channel of type j can be chosen with an identical probability among the available channel types in the set of S
D
l. Based on this explanation, the probability that the involved nodes in this hop switch their channel type, P
T
m
k, is
(8)
P
T
m
k
,
D
l
=
p
uspt
,
c
m
p
spt
,
c
k
∏
j
=
1
,
j
≠
m
,
k
L
‍
p
uspt
,
c
j
+
p
uspt
,
c
m
∑
S
D
l
⊆
T
∏
j
=
1,2
,
…
,
i
|
T
j
∈
S
D
l
,
j
≠
m
‍
p
sup
⁡
,
c
j
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
×
∏
j
=
1,2
,
…
,
i
|
T
j
∉
S
D
l
,
j
≠
m
‍
p
uspt
,
c
j
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
×
S
D
l
-
1
∏
j
=
1,2
,
…
,
i
|
T
j
∈
S
D
l
,
j
≠
m
‍
p
s
u
p
,
c
j
∑
S
D
l
⊆
T
∏
j
=
1,2
,
…
,
i
|
T
j
∈
S
D
l
,
j
≠
m
‍
p
s
u
p
,
c
j
.
The row vector Π
D
l
P, which is composed of Π
D
l
P
T
i, demonstrates the steady state probability for P
D
l considering different hop lengths. The value of Π
D
l
P
T
i is calculated using the equations:
(9)
Π
D
l
P
×
P
D
l
=
Π
D
l
P
,
∑
i
=
1
L
‍
Π
D
l
P
T
i
=
1
.
Ultimately, the steady state probabilities for various hop lengths for channel type i are calculated as below:
(10)
Π
P
T
i
=
∑
l
=
1
L
‍
Pr
⁡
R
l
-
1
<
d
<
R
l
Π
D
l
P
T
i
,
where Pr
⁡
R
l
-
1
<
d
<
R
l is calculated as [10]
(11)
Pr
⁡
R
l
-
1
<
d
<
R
l
=
F
d
R
l
-
F
d
(
R
l
-
1
)
=
exp
⁡
(
-
λ
π
R
l
-
1
2
/
2
)
-
exp
⁡
(
-
λ
π
R
l
2
/
2
)
1
-
exp
⁡
(
-
N
/
2
)
.The spectrum handoff procedure happens when the current channel can not support the data transmission. However, the spectrum handoff will not be initiated on any of the available channels due to other circumstances such as low channel transmission range as this can lead to transmission failure. Therefore, the probability of spectrum handoff can be formulated as(12)
P
SH
=
∑
i
=
1
L
‍
Π
P
T
i
p
uspt
,
c
i
-
∏
j
=
1
L
‍
p
uspt
,
c
j
.
In (12), the term ∑
i
=
1
L
‍
Π
P
T
i
∏
j
=
1
L
‍
p
uspt
,
c
j is the probability that all available channels have unsuccessful packet transmission. In such a case, the troubled nodes do not perform spectrum handoff; they perform local flow handoff. Therefore, the probability of local flow handoff can be expressed as follows:
(13)
P
LH
⁡
=
∑
i
=
1
L
‍
Π
P
T
i
∏
j
=
1
L
‍
p
uspt
,
c
j
.
The probability of successful spectrum handoff (
P
ssh
) depends on the probability of successful packet transmission in a hop, p
spt
,
c. The link maintenance probability (
P
LM
) is defined as the probability that the link is successfully maintained in a hop or between troubled nodes, which is dependent on the probability of channel availability between two nodes. Thus, the link maintenance probability, considering only spectrum handoff, can be written as
(14)
P
LM
,
SH
=
P
SH
×
p
spt
,
c
.
When the link maintenance is not successful, despite performing spectrum handoff, local rerouting is performed. In this case, the probability of link maintenance can be represented as
(15)
P
LM
,
LH
⁡
=
N
-
1
N
1
-
P
LM
,
SH
P
LH
⁡
×
p
spt
,
c
.
Finally, the probability of link maintenance, considering the integration of local routing and spectrum handoff management, can be stated as
(16)
P
LM
,
USH
=
P
LM
,
SH
+
P
LM
,
LH
⁡
.


## 4. Preemptive Unified Spectrum Handoff (PUSH) Scheme

In this section, the PUSH algorithm is proposed in which two different preemptive handoff threshold regions are defined and the cognitive link availability considering the PU interference boundary is predicted. The proposed handoff management scheme adapts to the unpredictable events, making a decision on the SUs data transmission without causing any interference with the PUs. The proposed algorithm for PUSH scheme is shown in the form of pseudocode presentation as shown in Pseudocode1.Pseudocode 1
Require: CSF
:
=
0, HMF
:
=
0, LAC
:
=
0  ⌀, LFHREP:= ⌀, CSA = ⌀
(1) check theHMF;
(2)if  HMF
:
=
1  then
(3)   go to (42)         //for checking the
H
M
(4)end if
(5)if there is no data to send then
(6)   go back to (2)         //for checking the
H
M
F
(7)end if
(8) start scanning radio
(9)P
U
z
*
O
N
-
=
s
e
n
s
e
(
c
h
a
n
n
e
l
,
t
s
,
s
w
i
t
c
h
i
n
g
)
(10)if  P
U
z
*
ON  then
(11)   defer forC
h
a
n
n
e
l
-
S
w
i
t
c
h
i
n
g
-
D
e
l
a
y
(12)   forN
e
x
t
-
C
h
a
n
n
e
l
-
D
e
c
i
s
i
o
n go to (24)
(13)CSF
=
1
(14)   go back to (5)         //to check the availability of data for sending
(15)end if
(16)if  (
CSF
)  then
(17)   Send notification to upper layers for spectrum handoff
(18)   adapt channel parameters
(19)CSF
:
=
0
(20)end if
(21)  start operation timer(
T
o
)
(22)  transmit data till(
T
o
) expires
(23)  go back to (2)
(24)for  k
:
=
1
,
k
<
C  do
(25)if  P
U
k
≠
ON  then
(26)NAC
:
=
NAC
+
1
(27)LAC
(
NAC
)
:
=
k
(28)end if
(29)end for
(30)if  LAC
:
=
∅  then
(31)  send RERR packet to the source node
(32)else  {
LAC
:
≠
∅
}
(33)   sendingCSR         //sending PU-HREQ
(34)   go to (36)
(35)end if
(36)upon receiving CSA  then
(37)if  CSA
≠
∅  then
(38)   switch to the selected channel
(39)HMF
:
=
0
(40)   go to (16)
(41)end if
(42)  calculate theHM
(43)if  HM
≤
LHTH  then
(44)   Start the LFHREQ timer, broadcast the LFHREQ and go to (49)
(45)else  {
HM
≤
SHTH
}
(46)   go to (24)         //for making a decision on the next channel
(47)end if
(48)upon the LFHREQ timer was expired then
(49)if  LFHREP
:
=
∅  then
(50)   broadcast the RERR to the source node
(51)else  {
LFHREP
≠
∅
}
(52)   find the best candidate node with themax
⁡
T
PU
(53)   send the Local route HR to the local source through the best candidate intermediate node
(54)   send theCSR to the candidate intermediate node
(55)   go back to (36)
(56)end if
(57)  endTable1 defines the abbreviations and their definitions used in the pseudocode. The decision-making unit initiates the handoff based on the handoff threshold. When the spectrum handoff cannot be implemented in one hop, the LFH will be established to maintain communication.Table 1
Different parameters and their definitions used in the PUSH algorithm.
Symbol
Definition
CSF
Channel switching flag
LAC
List of available and detected channels
HMF
Handoff metric flag
T
O
Operation time
t
s
Sensing time
NAC
Available channel number (channel ID)
RERR
Route error request
CSR
Channel switching request
CSA
Channel switching acknowledgment
HM
Handoff metricIn PUSH, PU activity is monitored by spectrum sensing and SU mobility is monitored by life time checking. If there is any problem with the SU mobility the HMF is activated and the algorithm will check the HM. Otherwise the algorithm checks for any available data to send. If there is no data to send, the algorithm remains in the event monitoring stage. When there is data to send, the PU activity is checked by the sensing part. The SUs continue their communication on the current channel until the expiration of the operation time (T
O). If there is any PU activity on the channel, the next channel for the handoff will be decided and the spectrum handoff will be performed. When the algorithm moves to check HM, if the HM is higher than the LHTH, only the spectrum handoff will be performed. The next channel for spectrum handoff must have a higher transmission range compared to the current channel. If the HM is lower than the LHTH, the troubled nodes try to find a suitable node as an intermediate node. Should there be no suitable node, the global flow handoff will be performed. Otherwise, the suitable node is chosen, the next channel will be decided, and the local flow handoff and consequently the spectrum handoff will be performed.


### 4.1. Channel and Local Flow Handoff Prediction

A link is considered available if the two nodes associated with the link are within the transmission range of each other and out of interference region of any PU. In terms of transmission range, two different handoff regions are defined based on different handoff types. These two regions are the preemptive channel handoff region and the preemptive local flow handoff region. As illustrated in Figure2, the first region is determined based on the channel transmission range, which is different for each channel type. The second region is determined by the node transmission range. Because the node transmission range depends on the wavelength of the transmission frequency, there is only one preemptive flow handoff region. Two different handoff thresholds are also defined related to each area. The first handoff threshold, which is related to the preemptive channel handoff region, is called the spectrum handoff threshold (SHTH).Figure 2
Different preemptive handoff regions.The second handoff threshold is the LFH threshold (LHTH), which is related to the preemptive LFH region. These handoff thresholds are used to initiate the handoff due to the node mobility and channel quality degradation. As illustrated in Figure2, nodes B and F are communicating with each other. When either node B or node F moves such that the current channel cannot support their communication, they must vacate the channel and transfer their transmission into another channel with a higher transmission range. In Figure 2, the W
ch
,
l is the warning distance for nodes communicating on a channel of type l. The t
w
,
l which is the interval from the warning till the communication link break off needs to be greater than or equal to the necessary time for performing the handoff. Different handoff thresholds are related to the signal power threshold. Here, the signal power of hello packets is used to approximate the distance between the transmitter and receiver.


### 4.2. Channel Usage Time Prediction

Using the above proposed channel and local flow handoff prediction scheme with samples of the transmitted signal, the availability time is estimated without any movement information. Each SU keeps a neighbour signal information table (NSIT). The NSIT contains information about the condition of links between SU and its neighbours.Based on [11], at least three packets are required to estimate the channel availability time. Suppose that at times t
1, t
2, and t
3 node F receives the first, second, and third signal with respective power P
1, P
2, and P
3 from node B. The SU registers the signal power strength and reception time for each neighbour in the NSIT. When node F receives packets from node B, it updates its NSIT array such that P
3
<
P
2
<
P
1 and t
1
<
t
2
<
t
3.Assume at timet the node F will receive a signal with power equivalent to the P
s, and during time t
1 to t the nodes F and B maintain their speeds and directions. Based on [11], the availability time is expressed as follows:
(17)
t
ava
=
b
2
-
4
a
c
-
b
2
a
,
where
(18)
a
=
Δ
t
2
P
2
P
s
d
,
b
=
P
s
(
(
P
1
-
P
2
)
-
Δ
t
2
2
P
2
d
)
c
=
Δ
t
2
P
2
P
s
-
Δ
t
2
P
1
P
2
,
Δ
t
2
=
t
2
-
t
1
,
Δ
t
3
=
t
3
-
t
1
d
=
(
P
1
P
2
Δ
t
2
+
P
2
P
3
Δ
t
3
-
P
1
P
3
Δ
t
3
-
P
2
P
3
Δ
t
2
)
(
Δ
t
2
Δ
t
3
2
-
Δ
t
3
Δ
t
2
2
)
P
2
P
3
.
When the P
s is replaced with the P
CTR
,
l, the channel availability time between two communicating nodes for the channel of type l (t
ava
,
l) is an estimated value.


### 4.3. PU Interference Awareness and Link Availability

In terms of the PUs activity, a link is considered available when both two nodes associated with this link are out of the interference region of any PU in the network.The PUSH scheme is aware of the PUs interference boundary and selects a suitable intermediate node with a high link availability time to handle the transmission in a LFH. To predict the link availability time considering the interference boundary of the PUs, the information about the distance between a mobile SU and each PU can be obtained through GPS or the path loss model. During the communication, the movement direction and velocity of mobile nodes can be considered constant in CR networks [12]. Based on [13], the d
PU, which denotes the distance between the SU and the PU, can be expressed as
(19)
d
PU
2
=
α
t
2
+
β
t
+
γ
,
where α, β, and γ are constants and they are calculated using three measurement points, (d
PU
,
0
,
t
PU
,
0), (d
PU
,
1
,
t
PU
,
1), and (d
PU
,
2
,
t
PU
,
2). If d
PU
,
th shows the radius of the PUs interference boundary, then the maximum link accessibility period, T
PU, with the PUs interference avoidance evaluated from t
PU
,
2 is expressed as
(20)
T
PU
=
β
2
+
4
d
PU
,
th
2
-
4
α
γ
-
β
2
a
-
t
PU
,
2
,
Δ
⩾
0
,
Δ
⩾
β
∞
,
otherwise
,
where
(21)
Δ
=
β
2
+
4
α
d
PU
,
th
2
-
4
α
γ
.
Considering the link accessibility period with the PUs interference avoidance, the most suitable intermediate node is a node with maximum T
PU.


### 4.4. Channel Allocation Scheme

To give a fair opportunity to the involved SUs in the longer hops, a weight matrixW with the size of L
×
L is proposed in the scheme. This weight matrix considers the hop length and the transmission range of the available channels, which can be expressed as follows:
(22)
W
=
1
1
2
⋯
1
L
0
1
⋯
1
L
-
1
0
0
⋯
L
L
.The rows show the various position casesD
l based on the hop length, and the column shows the available channel type l. Each element of W indicates a different location weight and is defined as follows:
(23)
w
l
,
D
l
=
0
channel
of
type
l
′
,
l
′
∈
1
,
…
,
l
-
1
1
channel
of
type
l
1
channel
type
channel
of
type
l
′
,
l
′
∈
l
+
1
,
…
,
L
.The hop length changing, which shows the SUs mobility, is considered in channel allocation scheme. The parameterh
l
,
D
l is proposed to show the possibility of using the channel of type l, detected by both nodes in the current hop and the position case D
l as follows:
(24)
h
l
,
D
l
=
1
channel
of
type
l
′
,
l
′
∈
l
,
…
,
L
0
channel
of
type
l
′
,
l
′
∈
1
,
…
,
l
-
1
.There are a numberC
l of channels of type l. Each channel of type l is shown by C
l
j. The channel j of type l can be used by the nodes belonging to the current hop, when it is available for both its member nodes. The parameter η is proposed to show the possibility of using the channel j of type l for communicating in the current hop:
(25)
η
C
l
j
=
1
channel
j
of
type
l
is
available
for
both
belonging
to
current
hop
0
otherwise
.To avoid handing off the data transmission to a channel with a short availability time, the channel availability time must be greater than a threshold. Therefore, the parameterζ is proposed to show the possibility of using the channel of type l in the current hop:
(26)
ζ
l
,
D
l
=
1
for
t
ava
,
l
,
D
l
≥
t
th
0
otherwise
.Finally, the channel allocation metric for channelj of type l can be derived as
(27)
A
M
C
l
j
=
(
ζ
l
,
D
l
)
·
(
η
C
l
j
)
·
(
h
l
,
D
l
)
·
(
w
l
,
D
l
)
·
(
t
ava
,
l
,
D
l
)
.Suppose that the setC
H
l
,
D
l shows the set of channels of type l detected by both nodes belonging to the current hop with position case D
l. The set C
H
D
l, which shows all the channels of different L types detected by both nodes belonging to the current hop with position case D
l, can be expressed as
(28)
C
H
D
l
=
⋃
l
′
=
1
L
‍
C
H
l
′
,
D
l
.
The set of detected and useable channels for communication in the current hop with position case D
l is defined as follows:
(29)
C
H
D
l
,
usable
=
⋃
l
′
=
1
L
‍
⋃
C
l
′
j
∈
C
H
l
′
,
D
l
‍
(
C
l
′
j
)
·
(
η
C
l
′
j
)
·
(
h
l
′
,
D
l
)
.
In the decision part, the channel j, which maximizes the channel allocation metric is formulated as below:
(30)
j
̌
=
arg
max
⁡
A
M
C
l
j
,
C
l
j
⊆
C
H
D
l
,
usable
.


### 4.5. Handoff Initiation and Connectivity Management

To maintain end-to-end connectivity, topological variations and channel quality degradation due to node mobility are addressed using the handoff request (HREQ) packets. On the other hand, the PU handoff request (PU-HREQ) is used to address the variations in spectrum availability because of the PUs activity. The single-hop PU-HREQ packet informs the neighbour nodes that the PUs activity has been detected on a special channel. On the other hand, the HREQ is applied to inform the next hop node that the current link is breaking due to node mobility.In terms of PU-HREQ, once a SU detects the PUs activity on a special channel, for example, channelC
l
k, the SU discards all the entries through channel C
l
k and informs its neighbours that the channel is busy using a PU-HREQ. The PU-HREQ packet contains the available and detected channels of the current SU. The SUs that receive the PU-HREQ invalidate the entries through C
l
k that involve the PU-HREQ source. Using the NSIT based on the channel allocation scheme described before, the SU that receives the PU-HREQ finds the channel j that maximizes the channel allocation metric described by (27). When the optimal channel is found, the node sends a handoff reply (PU-HREP) back. The PU-HREP contains the new channel information to perform handoff and continue the data transmission. In terms of the topological variation due to node mobility or channel quality degradation, once the SU predicts the handoff, it broadcasts a single-hop channel HREQ (CH-HREQ) packet to its next hop node. When the next node receives the CH-HREQ packet, it makes a decision using the NSIT by a method similar to the procedure for PU-HREQ.In LFH, when a SU as the local source (LS) predicts the presence of next hop node in the preemptive LFH region, it broadcasts a single-hop local flow HREQ (LFHREQ) containing the next hop nodes ID as the local destination (LD) through theCCC. LFH is performed to find an intermediate node (IN) for handling the data transmission responsibility. The selected node must be located in the transmission range of both nodes involved in current hop with the maximum link accessibility period T
PU. A neighbouring node that receives the LFHREQ will search its NIT to determine whether the LD is in its NIT. If node LD has been registered as a neighbor node in its NIT, the IN estimates the T
PU with all the active PUs in its surrounding area. It finds the minimum T
PU among all the PUs, and it sends the LFH reply (LFHREP) packet back to the LS. The LFHREP contains the minimum T
PU of the current node. The LS compares all the T
PU information received from its neighbors. Then, it selects the best node (BN) among candidate nodes through which nodes LS and LD can maintain the longest life time avoiding the PUs interference. Then, LS sends a handoff request (HR) to the local destination through the BN using CCC. The HR contains information such as the ID of the LS, the ID of the LD, and the channel availability list of the current node. Once the BN receives the HR, then we have the following.(i)
The BN compares its own available channelsC
ava
,
BN with the available channels of the local source C
ava
,
LS in HREQ. The usable channel set in this hop can be expressed as
(31)
C
H
D
l
,
usable
=
⋃
l
′
=
1
L
‍
C
ava
,
BN
,
l
′
∩
C
ava
,
LS
,
l
′
·
h
l
′
,
D
l
.
(ii)
The BN determines the channelj which maximizes the channel allocation metric from the channel set C
H
D
l
,
usable using (27).
(iii)
Letj be the selected channel, node BN updates HREQ with its own information, the ID of node LS, the ID of node LD, and its available channel list.
(iv)
Send the HREQ to the local destination node LD through the common control channel.When the LD node receives the HR, similar to the BN, it selects a proper channel for its upper hop. The local destination sends the handoff acknowledgment (HA) packet back to the LS. The HA message sets up a new route, and the routing tables in all three nodes are updated. Once the new route is established, the data flow will be passed along the new route. In the case that the LFH is not possible, the global flow handoff is performed by the source node.Although the PUSH scheme improves the handoff management scheme performance, the number of spectrum handoffs due to the PU activity should be reduced more. In the next section, the PC-PUSH scheme is proposed in which the fuzzy logic is used to improve the performance of the PUSH in terms of the number of spectrum handoffs because of the PU activity.


## 4.1. Channel and Local Flow Handoff Prediction

A link is considered available if the two nodes associated with the link are within the transmission range of each other and out of interference region of any PU. In terms of transmission range, two different handoff regions are defined based on different handoff types. These two regions are the preemptive channel handoff region and the preemptive local flow handoff region. As illustrated in Figure2, the first region is determined based on the channel transmission range, which is different for each channel type. The second region is determined by the node transmission range. Because the node transmission range depends on the wavelength of the transmission frequency, there is only one preemptive flow handoff region. Two different handoff thresholds are also defined related to each area. The first handoff threshold, which is related to the preemptive channel handoff region, is called the spectrum handoff threshold (SHTH).Figure 2
Different preemptive handoff regions.The second handoff threshold is the LFH threshold (LHTH), which is related to the preemptive LFH region. These handoff thresholds are used to initiate the handoff due to the node mobility and channel quality degradation. As illustrated in Figure2, nodes B and F are communicating with each other. When either node B or node F moves such that the current channel cannot support their communication, they must vacate the channel and transfer their transmission into another channel with a higher transmission range. In Figure 2, the W
ch
,
l is the warning distance for nodes communicating on a channel of type l. The t
w
,
l which is the interval from the warning till the communication link break off needs to be greater than or equal to the necessary time for performing the handoff. Different handoff thresholds are related to the signal power threshold. Here, the signal power of hello packets is used to approximate the distance between the transmitter and receiver.


## 4.2. Channel Usage Time Prediction

Using the above proposed channel and local flow handoff prediction scheme with samples of the transmitted signal, the availability time is estimated without any movement information. Each SU keeps a neighbour signal information table (NSIT). The NSIT contains information about the condition of links between SU and its neighbours.Based on [11], at least three packets are required to estimate the channel availability time. Suppose that at times t
1, t
2, and t
3 node F receives the first, second, and third signal with respective power P
1, P
2, and P
3 from node B. The SU registers the signal power strength and reception time for each neighbour in the NSIT. When node F receives packets from node B, it updates its NSIT array such that P
3
<
P
2
<
P
1 and t
1
<
t
2
<
t
3.Assume at timet the node F will receive a signal with power equivalent to the P
s, and during time t
1 to t the nodes F and B maintain their speeds and directions. Based on [11], the availability time is expressed as follows:
(17)
t
ava
=
b
2
-
4
a
c
-
b
2
a
,
where
(18)
a
=
Δ
t
2
P
2
P
s
d
,
b
=
P
s
(
(
P
1
-
P
2
)
-
Δ
t
2
2
P
2
d
)
c
=
Δ
t
2
P
2
P
s
-
Δ
t
2
P
1
P
2
,
Δ
t
2
=
t
2
-
t
1
,
Δ
t
3
=
t
3
-
t
1
d
=
(
P
1
P
2
Δ
t
2
+
P
2
P
3
Δ
t
3
-
P
1
P
3
Δ
t
3
-
P
2
P
3
Δ
t
2
)
(
Δ
t
2
Δ
t
3
2
-
Δ
t
3
Δ
t
2
2
)
P
2
P
3
.
When the P
s is replaced with the P
CTR
,
l, the channel availability time between two communicating nodes for the channel of type l (t
ava
,
l) is an estimated value.


## 4.3. PU Interference Awareness and Link Availability

In terms of the PUs activity, a link is considered available when both two nodes associated with this link are out of the interference region of any PU in the network.The PUSH scheme is aware of the PUs interference boundary and selects a suitable intermediate node with a high link availability time to handle the transmission in a LFH. To predict the link availability time considering the interference boundary of the PUs, the information about the distance between a mobile SU and each PU can be obtained through GPS or the path loss model. During the communication, the movement direction and velocity of mobile nodes can be considered constant in CR networks [12]. Based on [13], the d
PU, which denotes the distance between the SU and the PU, can be expressed as
(19)
d
PU
2
=
α
t
2
+
β
t
+
γ
,
where α, β, and γ are constants and they are calculated using three measurement points, (d
PU
,
0
,
t
PU
,
0), (d
PU
,
1
,
t
PU
,
1), and (d
PU
,
2
,
t
PU
,
2). If d
PU
,
th shows the radius of the PUs interference boundary, then the maximum link accessibility period, T
PU, with the PUs interference avoidance evaluated from t
PU
,
2 is expressed as
(20)
T
PU
=
β
2
+
4
d
PU
,
th
2
-
4
α
γ
-
β
2
a
-
t
PU
,
2
,
Δ
⩾
0
,
Δ
⩾
β
∞
,
otherwise
,
where
(21)
Δ
=
β
2
+
4
α
d
PU
,
th
2
-
4
α
γ
.
Considering the link accessibility period with the PUs interference avoidance, the most suitable intermediate node is a node with maximum T
PU.


## 4.4. Channel Allocation Scheme

To give a fair opportunity to the involved SUs in the longer hops, a weight matrixW with the size of L
×
L is proposed in the scheme. This weight matrix considers the hop length and the transmission range of the available channels, which can be expressed as follows:
(22)
W
=
1
1
2
⋯
1
L
0
1
⋯
1
L
-
1
0
0
⋯
L
L
.The rows show the various position casesD
l based on the hop length, and the column shows the available channel type l. Each element of W indicates a different location weight and is defined as follows:
(23)
w
l
,
D
l
=
0
channel
of
type
l
′
,
l
′
∈
1
,
…
,
l
-
1
1
channel
of
type
l
1
channel
type
channel
of
type
l
′
,
l
′
∈
l
+
1
,
…
,
L
.The hop length changing, which shows the SUs mobility, is considered in channel allocation scheme. The parameterh
l
,
D
l is proposed to show the possibility of using the channel of type l, detected by both nodes in the current hop and the position case D
l as follows:
(24)
h
l
,
D
l
=
1
channel
of
type
l
′
,
l
′
∈
l
,
…
,
L
0
channel
of
type
l
′
,
l
′
∈
1
,
…
,
l
-
1
.There are a numberC
l of channels of type l. Each channel of type l is shown by C
l
j. The channel j of type l can be used by the nodes belonging to the current hop, when it is available for both its member nodes. The parameter η is proposed to show the possibility of using the channel j of type l for communicating in the current hop:
(25)
η
C
l
j
=
1
channel
j
of
type
l
is
available
for
both
belonging
to
current
hop
0
otherwise
.To avoid handing off the data transmission to a channel with a short availability time, the channel availability time must be greater than a threshold. Therefore, the parameterζ is proposed to show the possibility of using the channel of type l in the current hop:
(26)
ζ
l
,
D
l
=
1
for
t
ava
,
l
,
D
l
≥
t
th
0
otherwise
.Finally, the channel allocation metric for channelj of type l can be derived as
(27)
A
M
C
l
j
=
(
ζ
l
,
D
l
)
·
(
η
C
l
j
)
·
(
h
l
,
D
l
)
·
(
w
l
,
D
l
)
·
(
t
ava
,
l
,
D
l
)
.Suppose that the setC
H
l
,
D
l shows the set of channels of type l detected by both nodes belonging to the current hop with position case D
l. The set C
H
D
l, which shows all the channels of different L types detected by both nodes belonging to the current hop with position case D
l, can be expressed as
(28)
C
H
D
l
=
⋃
l
′
=
1
L
‍
C
H
l
′
,
D
l
.
The set of detected and useable channels for communication in the current hop with position case D
l is defined as follows:
(29)
C
H
D
l
,
usable
=
⋃
l
′
=
1
L
‍
⋃
C
l
′
j
∈
C
H
l
′
,
D
l
‍
(
C
l
′
j
)
·
(
η
C
l
′
j
)
·
(
h
l
′
,
D
l
)
.
In the decision part, the channel j, which maximizes the channel allocation metric is formulated as below:
(30)
j
̌
=
arg
max
⁡
A
M
C
l
j
,
C
l
j
⊆
C
H
D
l
,
usable
.


## 4.5. Handoff Initiation and Connectivity Management

To maintain end-to-end connectivity, topological variations and channel quality degradation due to node mobility are addressed using the handoff request (HREQ) packets. On the other hand, the PU handoff request (PU-HREQ) is used to address the variations in spectrum availability because of the PUs activity. The single-hop PU-HREQ packet informs the neighbour nodes that the PUs activity has been detected on a special channel. On the other hand, the HREQ is applied to inform the next hop node that the current link is breaking due to node mobility.In terms of PU-HREQ, once a SU detects the PUs activity on a special channel, for example, channelC
l
k, the SU discards all the entries through channel C
l
k and informs its neighbours that the channel is busy using a PU-HREQ. The PU-HREQ packet contains the available and detected channels of the current SU. The SUs that receive the PU-HREQ invalidate the entries through C
l
k that involve the PU-HREQ source. Using the NSIT based on the channel allocation scheme described before, the SU that receives the PU-HREQ finds the channel j that maximizes the channel allocation metric described by (27). When the optimal channel is found, the node sends a handoff reply (PU-HREP) back. The PU-HREP contains the new channel information to perform handoff and continue the data transmission. In terms of the topological variation due to node mobility or channel quality degradation, once the SU predicts the handoff, it broadcasts a single-hop channel HREQ (CH-HREQ) packet to its next hop node. When the next node receives the CH-HREQ packet, it makes a decision using the NSIT by a method similar to the procedure for PU-HREQ.In LFH, when a SU as the local source (LS) predicts the presence of next hop node in the preemptive LFH region, it broadcasts a single-hop local flow HREQ (LFHREQ) containing the next hop nodes ID as the local destination (LD) through theCCC. LFH is performed to find an intermediate node (IN) for handling the data transmission responsibility. The selected node must be located in the transmission range of both nodes involved in current hop with the maximum link accessibility period T
PU. A neighbouring node that receives the LFHREQ will search its NIT to determine whether the LD is in its NIT. If node LD has been registered as a neighbor node in its NIT, the IN estimates the T
PU with all the active PUs in its surrounding area. It finds the minimum T
PU among all the PUs, and it sends the LFH reply (LFHREP) packet back to the LS. The LFHREP contains the minimum T
PU of the current node. The LS compares all the T
PU information received from its neighbors. Then, it selects the best node (BN) among candidate nodes through which nodes LS and LD can maintain the longest life time avoiding the PUs interference. Then, LS sends a handoff request (HR) to the local destination through the BN using CCC. The HR contains information such as the ID of the LS, the ID of the LD, and the channel availability list of the current node. Once the BN receives the HR, then we have the following.(i)
The BN compares its own available channelsC
ava
,
BN with the available channels of the local source C
ava
,
LS in HREQ. The usable channel set in this hop can be expressed as
(31)
C
H
D
l
,
usable
=
⋃
l
′
=
1
L
‍
C
ava
,
BN
,
l
′
∩
C
ava
,
LS
,
l
′
·
h
l
′
,
D
l
.
(ii)
The BN determines the channelj which maximizes the channel allocation metric from the channel set C
H
D
l
,
usable using (27).
(iii)
Letj be the selected channel, node BN updates HREQ with its own information, the ID of node LS, the ID of node LD, and its available channel list.
(iv)
Send the HREQ to the local destination node LD through the common control channel.When the LD node receives the HR, similar to the BN, it selects a proper channel for its upper hop. The local destination sends the handoff acknowledgment (HA) packet back to the LS. The HA message sets up a new route, and the routing tables in all three nodes are updated. Once the new route is established, the data flow will be passed along the new route. In the case that the LFH is not possible, the global flow handoff is performed by the source node.Although the PUSH scheme improves the handoff management scheme performance, the number of spectrum handoffs due to the PU activity should be reduced more. In the next section, the PC-PUSH scheme is proposed in which the fuzzy logic is used to improve the performance of the PUSH in terms of the number of spectrum handoffs because of the PU activity.


## 5. Fuzzy Based PC-PUSH Scheme

Here, the PC-PUSH algorithm is proposed. In PC-PUSH, each SU is equipped with an FB-PC strategy that is an adaptive decision-making unit. The FB-PC strategy improves the spectrum handoff performance of the SU by adapting to the network conditions, traffic changes, and consequently controlling the interference to the PUs. The proposed PC-PUSH scheme adapts to unpredictable events and makes a decision on the SUs data transmission without causing any interference to the PUs. Therefore, CR must change its parameters according to the decision before transmitting the signal. The changes in pseudocode presentation of PC-PUSH scheme compared to the PUSH scheme are as shown in Pseudocode2.Pseudocode 2
⋮
Start scanning radio;
P
U
z
*
O
N
-
=
s
e
n
s
e
(
c
h
a
n
n
e
l
,
t
s
,
s
w
i
t
c
h
i
n
g
)
if  P
U
z
*
ON  then
go to the Decision.  Policy.
if switching must be done then
defer forC
h
a
n
n
e
l
-
S
w
i
t
c
h
i
n
g
-
D
e
l
a
y
forN
e
x
t
-
C
h
a
n
n
e
l
-
D
e
c
i
s
i
o
n go to (26)
CSF
=
1
go back to (5)         //to check the availability of data for sending
end if
end if
⋮As it can be seen in line 10 of the proposed pseudocode for the PC-PUSH scheme, when the PU activity is detected, the algorithm will be directed to the decision-making part (line 11). The decision policy, which is a fuzzy decision strategy, qualitatively determines whether SU should switch its ongoing data transmission to another unused channel or it can change its power level in order to avoid interference with PU and stay in the current channel. While in the PUSH scheme, once the occupied band is claimed by PU, the SU switchs its ongoing data transmission to another unused channel. In the next subsection, the FB-PC strategy will be explained.


### 5.1. Fuzzy Based (FB) Power Controller (PC) Strategy

The proposed FB-PC strategy tries to keep the transmission power of the SU at an acceptable level in order to avoid interference with PU while ensuring proper signal quality at the receiving end. When the SU decides to stay in the current spectrum band, its transmission power is balanced between a minimum required transmission power (P
min
⁡
,
req) and a maximum acceptable transmission power (P
max
⁡
,
acp) considering the allowed interference level at the PU. The minimum required transmission power (P
min
⁡
,
req) determines the SU transmit power just enough to satisfy the required SINR at SU receiver.Same as the general fuzzy logic controller [14], the proposed FB-PC strategy consists of four modules named as fuzzifier, fuzzy rule base, inference engine, and defuzzifier. The controlling operation is started by measuring the variables that show the relevant conditions of the controlled process. There are two input linguistic variables in FB-PC strategy.As Figure3 shows, the P
max
⁡
,
acp as the maximum acceptable transmission power at the SU location and the SIN
R
diff as the difference between required SINR (SIN
R
req) and the measured SINR (SIN
R
meas
⁡) at the SU receiver are two input linguistic variables. In the next step, these measurements are transferred into fuzzy sets (fuzzification) to show the uncertainties in measurements. Then, using these measurements, the interference engine evaluates the control rules stored in the fuzzy rule base module. Finally, the results of this evaluation which can be several fuzzy sets determined on the universe of discourse of possible actions are converted to crisp values (defuzzification). Each input linguistic variable is characterized by a term set of three fuzzy sets, “Low,” “Medium,” and “High.”Figure 3
Fuzzy based Power Controller strategy.The FB-PC strategy is characterized by two outputs. The first output (Sw) shows whether the channel switching must be performed or not. The second output (R
PC), which shows the transmit power control ratio, indicates how the SU transmission power should be modified when the channel switching is not necessary. The term set of S
w output linguistic variable consists of three fuzzy sets, “Yes,” “Probably Yes,” and “No.” While the term set of R
PC output linguistic variable consists of three fuzzy sets, “Low,” “Medium,” and “High.” The fuzzy inference rules can be easily derived from these term sets.To calculate theP
max
⁡
,
acp, the path loss model is used. Consider I
PU
,
lim
⁡ as a predefined interference temperature limit for an active PU, which implies that both the SU and PU can use the licensed spectrum band simultaneously, but the SU must guarantee an interference temperature level perceived by the PU less than I
PU
,
lim
⁡ [15]. It means that if the total interference level originating from noise floor (NF), other PUs activities, and so on is kept below the I
PU
,
lim
⁡, the SU can use the spectrum bands opportunistically. Therefore, an allowed interference temperature for SU (I
SU
,
max
⁡) to the target PU is as follows:
(32)
I
SU
,
max
⁡
=
I
PU
,
lim
⁡
-
I
-
NF
.
in which I shows the interference from other PUs and NF indicates noise floor power level.Using the path loss model, theI
SU
,
max
⁡ is converted to the corresponding P
max
⁡
,
acp at a SU’s location as follows [16]:
(33)
I
SU
,
max
⁡
=
P
max
⁡
,
acp
d
0
d
PU
n
,
where n is a number typically between 2 and 4, d
0 shows the reference distance, and d
PU denotes the distance between the SU and the target PU explained in Section 4.3. Therefore, considering (33), it can be concluded that
(34)
P
max
⁡
,
acp
=
I
SU
,
max
⁡
d
0
d
PU
-
n
.
Finally, considering (33) and (34), the maximum acceptable transmission power is calculated as follows:
(35)
P
max
⁡
,
acp
dB
=
I
SU
,
max
⁡
dB
-
10
·
n
·
lo
g
10
d
0
d
PU
dB
.


## 5.1. Fuzzy Based (FB) Power Controller (PC) Strategy

The proposed FB-PC strategy tries to keep the transmission power of the SU at an acceptable level in order to avoid interference with PU while ensuring proper signal quality at the receiving end. When the SU decides to stay in the current spectrum band, its transmission power is balanced between a minimum required transmission power (P
min
⁡
,
req) and a maximum acceptable transmission power (P
max
⁡
,
acp) considering the allowed interference level at the PU. The minimum required transmission power (P
min
⁡
,
req) determines the SU transmit power just enough to satisfy the required SINR at SU receiver.Same as the general fuzzy logic controller [14], the proposed FB-PC strategy consists of four modules named as fuzzifier, fuzzy rule base, inference engine, and defuzzifier. The controlling operation is started by measuring the variables that show the relevant conditions of the controlled process. There are two input linguistic variables in FB-PC strategy.As Figure3 shows, the P
max
⁡
,
acp as the maximum acceptable transmission power at the SU location and the SIN
R
diff as the difference between required SINR (SIN
R
req) and the measured SINR (SIN
R
meas
⁡) at the SU receiver are two input linguistic variables. In the next step, these measurements are transferred into fuzzy sets (fuzzification) to show the uncertainties in measurements. Then, using these measurements, the interference engine evaluates the control rules stored in the fuzzy rule base module. Finally, the results of this evaluation which can be several fuzzy sets determined on the universe of discourse of possible actions are converted to crisp values (defuzzification). Each input linguistic variable is characterized by a term set of three fuzzy sets, “Low,” “Medium,” and “High.”Figure 3
Fuzzy based Power Controller strategy.The FB-PC strategy is characterized by two outputs. The first output (Sw) shows whether the channel switching must be performed or not. The second output (R
PC), which shows the transmit power control ratio, indicates how the SU transmission power should be modified when the channel switching is not necessary. The term set of S
w output linguistic variable consists of three fuzzy sets, “Yes,” “Probably Yes,” and “No.” While the term set of R
PC output linguistic variable consists of three fuzzy sets, “Low,” “Medium,” and “High.” The fuzzy inference rules can be easily derived from these term sets.To calculate theP
max
⁡
,
acp, the path loss model is used. Consider I
PU
,
lim
⁡ as a predefined interference temperature limit for an active PU, which implies that both the SU and PU can use the licensed spectrum band simultaneously, but the SU must guarantee an interference temperature level perceived by the PU less than I
PU
,
lim
⁡ [15]. It means that if the total interference level originating from noise floor (NF), other PUs activities, and so on is kept below the I
PU
,
lim
⁡, the SU can use the spectrum bands opportunistically. Therefore, an allowed interference temperature for SU (I
SU
,
max
⁡) to the target PU is as follows:
(32)
I
SU
,
max
⁡
=
I
PU
,
lim
⁡
-
I
-
NF
.
in which I shows the interference from other PUs and NF indicates noise floor power level.Using the path loss model, theI
SU
,
max
⁡ is converted to the corresponding P
max
⁡
,
acp at a SU’s location as follows [16]:
(33)
I
SU
,
max
⁡
=
P
max
⁡
,
acp
d
0
d
PU
n
,
where n is a number typically between 2 and 4, d
0 shows the reference distance, and d
PU denotes the distance between the SU and the target PU explained in Section 4.3. Therefore, considering (33), it can be concluded that
(34)
P
max
⁡
,
acp
=
I
SU
,
max
⁡
d
0
d
PU
-
n
.
Finally, considering (33) and (34), the maximum acceptable transmission power is calculated as follows:
(35)
P
max
⁡
,
acp
dB
=
I
SU
,
max
⁡
dB
-
10
·
n
·
lo
g
10
d
0
d
PU
dB
.


## 6. Results and Discussions

In this section, the performance of the proposed unified handoff management is analyzed and evaluated through extensive simulations considering the various conditions of the network, traffics, and mobility parameters. The throughput of the whole system will be analyzed to check for any significant improvement by introducing unified spectrum handoff management scheme. Here, a patch of NS-2 for cognitive radio cognitive network (CRCN), which supports various functionalities of the cognitive radio networks, is used with some modifications for the extensive simulation of the proposed scheme. The AODV [17] routing protocol is used for route formation over CR-MANETs.The performance improvement achieved by the proposed method is demonstrated using four different versions of the handoff management schemes that are defined as the spectrum handoff (SH), the USH, the PUSH, and the PC-PUSH algorithm. The terminology applied for the simulation study is described as follows. The first scheme, SH, only deploys the spectrum handoff, while the remaining three schemes deploy the unified spectrum handoff in which the local flow handoff will be added to the system. One of these three schemes, USH, does not consider the preemptive handoff threshold, whereas two others, PUSH and PC-PUSH, consider the preemptive handoff threshold for the preemptive handoff region and also consider the PU interference boundary. Finally, the PC-PUSH performs the FB-PC strategy to avoid spectrum handoff.The transmission range of the static PUs on their occupied channels is set to 200 m, and the PUs activity is modeled as a two-stage on/off procedure with an exponential distribution. An average of 40 trial runs is used in which the locations of the PU nodes are randomly chosen. Depending on the simulation scenario, a different number of mobile SUs are distributed in the network. For SUs mobility, random waypoint model is applied with a speed uniformly distributed from minimal speed 1 m/s to maximal speed 10 m/s in which the pause time is set to 0.0 seconds. In some simulation scenarios, the SUs speed is fixed to a predetermined point. The sensing time and operation time are fixed to 0.1 sec and 0.9 sec, respectively. The total number of available channelsC
=
10 is classified into 2 different types. The center carrier frequencies of available data channels are 200 MHz and 800 MHz. The transmission ranges of different channel types and the node transmission range are set to R
1
=
75m, R
2
=
125m, and R
T
=
150m, respectively. The mobile SUs are distributed in a network within a 2000
m
×
2000
m area. Both the W
ch
,
l, which is the warning distance for the preemptive channel handoff region for nodes communicating on a channel of type l, and W
link, which is defined as the threshold distance for the preemptive local flow handoff region, are set to 12 m. Both channel usage time and the link life time threshold are set to 12 seconds.


### 6.1. Number of Spectrum Handoffs, Link Maintenance, and Spectrum Handoff Delay Performance

In this subsection, the SUs route maintenance probability, number of required spectrum handoffs, and spectrum handoff delay are investigated.The probability of unsuccessful link maintenance is defined as the probability of spectrum handoff blocking(
P
hb
). Figure 4 evaluates the different handoff management schemes in terms of the (
P
hb
). Based on the analytical model, Figure 4(a) compares the probability of unsuccessful rerouting (
P
usrr
), the (
P
hb
,
SH
), and the (
P
hb
,
USH
), considering various numbers of SU nodes in the network with a number of hops equal to 5. Based on this figure, the USH scheme outperforms the SH scheme in terms of link maintenance probability. The probability of link maintenance in the USH scheme is also significantly higher than the probability of successful rerouting. As the number of SUs in the network increases, the probability of handoff blocking decreases because the probability of finding the proper nodes, which work as the relay to perform local rerouting, increases.Comparison of different handoff management schemes performance in terms of(
P
hb
).
(a)
Versus number of the SUs
(b)
Versus the arrival rate of the PUsFigure4(b) shows the handoff blocking probability based on both analytical model and real time simulation considering various arrival rates of the PUs in the network. Based on this figure, in the analytical model, the unified handoff management scheme outperforms the scheme deploying only spectrum handoff in terms of link maintenance probability, which is also verified by the simulation results. The simulation results indicate that the spectrum handoff blocking probability in the PUSH scheme is lower than the probability of the spectrum handoff blocking in the scheme deploying only spectrum handoff. This is caused by LFH deployment in PUSH. Moreover, the P
hb
,
PUSH is lower than the probability of handoff blocking in the scheme deploying USH.Figure5 shows the expected amount of handoff requirement for the SUs. To evaluate the effects of the PU’s activity and the SU’s mobility, the PU’s arrival rate and SU’s velocity vary in Figures 5(a) and 5(b), respectively. From this figure, it can be stated that the FB-PC strategy reduces the number of required handoffs in the handoff management scheme significantly. Based on Figure 5(b), rather than the PU activity, the SU’s mobility has an important effect on the performance of the CR network. Hence, the mobility of SUs must be considered in the handoff management schemes.The expected amount of handoff requirements for the SUs.
(a)
Versus the arrival rate of PUs
(b)
Versus the velocity of SUsTo investigate the effects of the preemptive handoff management and FB PC strategy on the amount of handoff delay, Figure6 shows the simulation results of the average spectrum handoff delay under different network conditions. The PU’s arrival rate and SU’s velocity vary in Figures 6(a) and 6(b), respectively. From these figures, it can be stated that, by using the preemptive unified handoff management scheme, the average spectrum handoff delay is reduced significantly. It can also be stated that the FB-PC strategy reduces the amount of handoff delay because the number of spectrum handoffs is decreased and the total handoff delay will be reduced. Here, the preemptive strategy reduces the number of spectrum handoffs arising from the SU mobility, while the FB-PC strategy reduces the number of spectrum handoffs originating from the PU activity.Average spectrum handoff delay under different network conditions.
(a)
Versus the arrival rate of PUs
(b)
Versus the velocity of SUsFigure7 shows the route maintenance probability for the SUs versus the arrival rate of PUs. Based on this figure, it is stated that the proposed unified handoff approach efficiently improves the route maintenance probability. This figure also shows that the proposed PC-PUSH scheme outperforms other handoff management schemes in terms of maintaining the established routes.Figure 7
Route maintenance probability for the SUs versus the arrival rate of PUs.


### 6.2. SU Throughput

In this subsection, the performance of different handoff management schemes in terms of SU’s throughput is analyzed and evaluated. Figure8 shows the SU throughput considering different network conditions. Figure 8(a) shows the SU throughput under various numbers of PU channels. As the number of PU channels increases, the SUs throughput increases because more channels can be exploited by the SUs for data transmissions. In this figure, the FB PC-PUSH scheme outperforms the three other schemes in terms of SU throughput. Figure 8(b) shows the SU throughput versus the arrival rate of PUs. This figure confirms that the PC-PUSH improves the SU throughput performance for increasing PU arrival rate in comparison with both PUSH and USH schemes. This is because of the FB PC strategy conducted by the PC-PUSH scheme that decreases the number of handoffs increases the probability of successful link maintenance and also decreases the handoff delay. Furthermore, there is an obvious difference in SUs throughput for the SH and the PUSH protocols as the former does not account for the local flow handoff and also PU activity regions avoidance.Comparison of the performance of different handoff management schemes in terms of the SUs throughput versus different network conditions.
(a)
Versus the numbers of PU channels
(b)
Versus the arrival rate of PUs


## 6.1. Number of Spectrum Handoffs, Link Maintenance, and Spectrum Handoff Delay Performance

In this subsection, the SUs route maintenance probability, number of required spectrum handoffs, and spectrum handoff delay are investigated.The probability of unsuccessful link maintenance is defined as the probability of spectrum handoff blocking(
P
hb
). Figure 4 evaluates the different handoff management schemes in terms of the (
P
hb
). Based on the analytical model, Figure 4(a) compares the probability of unsuccessful rerouting (
P
usrr
), the (
P
hb
,
SH
), and the (
P
hb
,
USH
), considering various numbers of SU nodes in the network with a number of hops equal to 5. Based on this figure, the USH scheme outperforms the SH scheme in terms of link maintenance probability. The probability of link maintenance in the USH scheme is also significantly higher than the probability of successful rerouting. As the number of SUs in the network increases, the probability of handoff blocking decreases because the probability of finding the proper nodes, which work as the relay to perform local rerouting, increases.Comparison of different handoff management schemes performance in terms of(
P
hb
).
(a)
Versus number of the SUs
(b)
Versus the arrival rate of the PUsFigure4(b) shows the handoff blocking probability based on both analytical model and real time simulation considering various arrival rates of the PUs in the network. Based on this figure, in the analytical model, the unified handoff management scheme outperforms the scheme deploying only spectrum handoff in terms of link maintenance probability, which is also verified by the simulation results. The simulation results indicate that the spectrum handoff blocking probability in the PUSH scheme is lower than the probability of the spectrum handoff blocking in the scheme deploying only spectrum handoff. This is caused by LFH deployment in PUSH. Moreover, the P
hb
,
PUSH is lower than the probability of handoff blocking in the scheme deploying USH.Figure5 shows the expected amount of handoff requirement for the SUs. To evaluate the effects of the PU’s activity and the SU’s mobility, the PU’s arrival rate and SU’s velocity vary in Figures 5(a) and 5(b), respectively. From this figure, it can be stated that the FB-PC strategy reduces the number of required handoffs in the handoff management scheme significantly. Based on Figure 5(b), rather than the PU activity, the SU’s mobility has an important effect on the performance of the CR network. Hence, the mobility of SUs must be considered in the handoff management schemes.The expected amount of handoff requirements for the SUs.
(a)
Versus the arrival rate of PUs
(b)
Versus the velocity of SUsTo investigate the effects of the preemptive handoff management and FB PC strategy on the amount of handoff delay, Figure6 shows the simulation results of the average spectrum handoff delay under different network conditions. The PU’s arrival rate and SU’s velocity vary in Figures 6(a) and 6(b), respectively. From these figures, it can be stated that, by using the preemptive unified handoff management scheme, the average spectrum handoff delay is reduced significantly. It can also be stated that the FB-PC strategy reduces the amount of handoff delay because the number of spectrum handoffs is decreased and the total handoff delay will be reduced. Here, the preemptive strategy reduces the number of spectrum handoffs arising from the SU mobility, while the FB-PC strategy reduces the number of spectrum handoffs originating from the PU activity.Average spectrum handoff delay under different network conditions.
(a)
Versus the arrival rate of PUs
(b)
Versus the velocity of SUsFigure7 shows the route maintenance probability for the SUs versus the arrival rate of PUs. Based on this figure, it is stated that the proposed unified handoff approach efficiently improves the route maintenance probability. This figure also shows that the proposed PC-PUSH scheme outperforms other handoff management schemes in terms of maintaining the established routes.Figure 7
Route maintenance probability for the SUs versus the arrival rate of PUs.


## 6.2. SU Throughput

In this subsection, the performance of different handoff management schemes in terms of SU’s throughput is analyzed and evaluated. Figure8 shows the SU throughput considering different network conditions. Figure 8(a) shows the SU throughput under various numbers of PU channels. As the number of PU channels increases, the SUs throughput increases because more channels can be exploited by the SUs for data transmissions. In this figure, the FB PC-PUSH scheme outperforms the three other schemes in terms of SU throughput. Figure 8(b) shows the SU throughput versus the arrival rate of PUs. This figure confirms that the PC-PUSH improves the SU throughput performance for increasing PU arrival rate in comparison with both PUSH and USH schemes. This is because of the FB PC strategy conducted by the PC-PUSH scheme that decreases the number of handoffs increases the probability of successful link maintenance and also decreases the handoff delay. Furthermore, there is an obvious difference in SUs throughput for the SH and the PUSH protocols as the former does not account for the local flow handoff and also PU activity regions avoidance.Comparison of the performance of different handoff management schemes in terms of the SUs throughput versus different network conditions.
(a)
Versus the numbers of PU channels
(b)
Versus the arrival rate of PUs


## 7. Conclusion

Spectrum handoff management is an open issue in CR networks. It is particularly challenging in CR-MANETs. In CR-MANETs, the available spectrum bands vary over time and space, while they are distributed nonadjacently over a broad frequency range. However, in CR-MANETs, the fluctuation of PU activity and the SU mobility make the issue of maintaining optimal routes more complex. In this work, a unified spectrum handoff management scheme is presented where it considers spectrum mobility in the time and space domains and considers the network topology variations in CR-MANETs. A network architecture that considers the heterogeneous spectrum availability and its variation over time, space, and distributed nodes is proposed in which the handoff is performed preemptively. The proposed PUSH algorithm predicts the cognitive link availability considering the PU interference boundary. Although the PUSH scheme improves the handoff management scheme performance, the number of spectrum handoffs due to the PU activity should be reduced more. Therefore, the PC-PUSH (Power Controller-PUSH) scheme is proposed in which the fuzzy logic is used to improve the performance of the PUSH in terms of the number of spectrum handoffs because of the PU activity. The PC-PUSH decreases the interference with the PUs, while reducing the number of spectrum handoffs. The results of both analytical model and simulation study verify that the proposed scheme improves the link maintenance probability, decreases the handoff delay, and reduces the number of spectrum handoffs.



---

*Source: 926709-2014-11-26.xml*