# SVM-Based Spectrum Mobility Prediction Scheme in Mobile Cognitive Radio Networks

Authors: Yao Wang; Zhongzhao Zhang; Lin Ma; Jiamei Chen
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Spectrum mobility as an essential issue has not been fully investigated in mobile cognitive radio networks (CRNs). In this paper, a novel support vector machine based spectrum mobility prediction (SVM-SMP) scheme is presented considering time-varying and space-varying characteristics simultaneously in mobile CRNs. The mobility of cognitive users (CUs) and the working activities of primary users (PUs) are analyzed in theory. And a joint feature vector extraction (JFVE) method is proposed based on the theoretical analysis. Then spectrum mobility prediction is executed through the classification of SVM with a fast convergence speed. Numerical results validate that SVM-SMP gains better short-time prediction accuracy rate and miss prediction rate performance than the two algorithms just depending on the location and speed information. Additionally, a rational parameter design can remedy the prediction performance degradation caused by high speed SUs with strong randomness movements.


---

## Body

## 1. Introduction

Cognitive radio (CR) as a solution for the next generation wireless networks brings new hope to address the wireless spectrum inefficiency problem which has attracted a great deal of attention in recent years [1–4]. In general, CR paradigms are classified in three types: interweave, underlay, and overlay. In interweave or opportunistic spectrum access (OSA) model [5, 6], CUs can use the licensed spectrums opportunistically when the spectrums are detected idle by spectrum sensing. It is very sensitive to PU traffic pattern and it relies on the detection error for the models [6, 7]. Thus, it is essential to investigate the spectrum mobility which is the foundation of resource allocation and network construction.In a CRN, the spectrum mobility for CUs includes two aspects: spectrum mobility in the time domain and spectrum mobility in the space domain [8]. The time-varying and space-varying characteristics of the spectrum mobility lead to the problem that it is hard to access the licensed spectrums for CUs in a real network. Time-varying characteristic is because of the random variations of PUs’ arrivals and departures. Thus, some related literatures have focused on the impact of PUs’ activity on CRNs [9–11]. In [12], a selective opportunistic spectrum access scheme is proposed with the aid of PUs’ traffic prediction techniques. The scheme can estimate the probability of a channel being idle and choose the best order of spectrum sensing to maximize spectrum efficiency. The definition of channel availability vector is introduced to characterize the state information of licensed channels [13]. And a prediction-based sensing approach is presented to maximize system throughput which reduces the sensing time. In [14], a forecast scheme of call arrival rate and call holding time for PUs is proposed. CUs can reduce the frequency hopping rate through the traffic pattern prediction of PUs.In the space domain, the movement of CUs directly results in the changing of the spectrum availability. Nevertheless, the movement of CUs, as one of the most important factors in wireless communication systems, is not adequately discussed for CRNs in existing works. A mobility model describing airborne nodes is proposed in [15]. And a stability-capacity-adaptive routing scheme is proposed to achieve high throughput and small transmission time based on the model. In [16], an optimal power control algorithm in mobile CR ad hoc networks is proposed. Without causing harmful interference to PUs, the network achieves maximized throughput based on the algorithm in the legacy network. In [17], a cluster-based routing protocol which can increase throughput and reduce data delivery latency is presented to mend the route in mobile CRNs. In [18], a general scheduling framework with the mobility information is conducted to solve maximum throughput channel scheduling problem for mobile CRNs. And two polynomial time optimal algorithms are proposed and evaluated by using the mobility trace obtained from a real public transportation system.However, few of existing works investigate the following two issues: (1) considering time domain and space domain characteristics of spectrum mobility together and (2) considering the prediction of spectrum mobility. In practice, a CRN should be forward looking rather than reactive [19]. And a prediction-based CRN can not only improve system performance but also minimize interference to PUs [20–22], because spectrum detecting may take a long time or delay. In [23], a neural network based channel status predictor using multilayer perceptron is proposed. The system spectrum utilization is improved and the sensing energy is saved greatly by predicting the idle channels. In [24], a channel handoff scheme based on SVM is presented to reduce the handoff time. The channel handoff caused by the random movement of PUs and CUs is considered in the prediction design. In [25], a binary time series approach is used to predict the future occupancy of neighboring channels. This approach performs very well for deterministic occupancy even without updating data.The key contributions of this paper are as follows: (1) we first take the two issues discussed above into account at the same time. And an effective joint feature vector extraction scheme is originally designed through the theoretical analysis on joint information of CUs’ mobility and PUs’ working activities. (2) Based on the extracted joint feature vector, a novel SVM-based spectrum mobility prediction scheme considering the time-space domain of spectrum mobility together is proposed for mobile CRNs in order to ameliorate the traditional prediction methods only utilizing the location and speed information directly. (3) Finally, simulations are conducted to confirm the effectiveness of the proposed prediction mechanism. The new prediction mechanism achieves higher short-time prediction performance than the conventional algorithms with little training nodes, which is vital in CRNs.The rest of the paper is organized as follows. The system model is described in Section2 and the spectrum availability of SUs is discussed in Section 3. In Section 4, a spectrum mobility prediction scheme is proposed based on SVM. The simulation results are shown along with a discussion in Section 5. At last, Section 6 concludes the paper.


## 2. System Model

### 2.1. Mobile CRN System Model

In this paper, we consider a mobile CRN scenario whereN
c CUs coexist with N
p PUs illustrated in Figure 1. Assume that each P
U
p
(
p
=
1
:
N
p
) has a licensed access to a spectrum c
p with a coverage radius R
p. Thus, the number of PUs is equal to the number of spectrums in the network. Each C
U
c
(
c
=
1
:
N
c
), with an interference radius r, can exploit locally unused licensed spectrum opportunistically without causing any interference to the corresponding P
U
p. Suppose that the CRN assigns spectrums periodically with an allocation interval time T
c which is the interval time between two times of spectrum allocation. We also assume spectrum sensing is ideal in this paper.Figure 1
System model of a mobile CRN.Figure1 gives out an instantaneous snapshot of a mobile CRN deployment with 20 mobile CUs. Two PUs are located in the area. The activity of each P
U
p
(
p
=
2 in Figure 1) is characterized as an on/off (busy/idle) model. The busy time and idle time of P
U
pcan be modeled by the exponential distribution with means α
p and β
p, respectively [26–28]. The probability density function (PDF) can be written, respectively, as
(1)
f
ON
(
t
,
α
p
)
=
1
α
p
e
-
t
/
α
p
,
t
≥
0
,
f
OFF
(
t
,
β
p
)
=
1
β
p
e
-
t
/
β
p
,
t
≥
0
.In this paper, a random mobility model which characterizes the movement of CUs in a two-dimensional space is considered [29]. The movement of each C
U
c consists of a sequence of random length intervals called mobility epochs during which C
U
c moves at a constant speed in a constant direction. And the mobility epoch lengths T
e are independently exponentially distributed with mean 1
/
λ
e. The probability distribution function can be expressed as
(2)
M
e
(
x
)
=
P
(
T
e
≤
x
)
=
1
-
e
-
λ
e
x
.During each epoch, the mobile direction ofC
U
c is uniformly distributed over [
0,2
π
) and the speed of C
U
c is uniformly distributed over [
0
,
v
max
⁡
]. We assume mobility is uncorrelated among all the CUs in a network. And it is reasonable to assume that epoch length, speed, and direction are uncorrelated in the model. Figure 2 shows a mobility trajectory of one given C
U
c as an example.Figure 2
A mobility trajectory example for one givenC
U
c.Definition 1.
Given a licensed spectrumc
p and an instantaneous time t, the instantaneous spectrum availability IS
A
p
c
(
t
) for one C
U
c can be defined as
(3)
IS
A
p
c
(
t
)
=
{
-
1
D
p
,
c
(
t
)
<
R
p
+
r
c
∩
(
α
p
(
t
)
=
-
1
)
1
D
p
,
c
(
t
)
<
R
p
+
r
c
∩
(
α
p
(
t
)
=
1
)
1
D
p
,
c
(
t
)
≥
R
p
+
r
c
.IS
A
p
c
(
t
)
=
1 means that licensed spectrum c
p is instantaneously available at t for C
U
c and IS
A
p
c
(
t
)
=
-
1 means that licensed spectrum c
p is not instantaneous available at t for C
U
c, where D
p
,
c
(
t
) represents the Euclidean distance between P
U
p and C
U
c at t. α
p
(
t
) represents the time-varying working activity of P
U
p, denoted as
(4)
α
p
(
t
)
=
{
1
P
U
p
is
idle
at
t
-
1
P
U
p
is
busy
at
t
.Definition 2.
Given a licensed spectrumc
p and a continuous period T, the continuous spectrum availability CS
A
p
c
(
T
) for one C
U
c can be defined as
(5)
CS
A
p
c
(
T
)
=
{
(
c
,
p
)
∣
IS
A
p
c
(
t
)
=
1
from
t
0
to
t
0
+
T
}
,
where t
0 is a given reference time. CS
A
p
c
(
T
)
=
1 means that spectrum c
p is available to C
U
c not only at t
0 but also at any time between t
0 and t
0
+
T. CS
A
p
c
(
T
)
=
1 means that spectrum c
p is not available to C
U
c at some time between t
0 and t
0
+
T. In practice, T could be a slot or some slots, during which C
U
c can achieve activation and access to the network. Apparently, we focus more on CS
A
p
c
(
T
) because a continuous time period (or a short-time duration) rather than an instantaneous time is more meaningful for OSA or resource allocation in CRN.Our objective is to give out the spectrum mobility prediction for all the CUs based on the joint theoretical analysis of CUs’ mobility and PUs’ working activities under the mobile model. Obviously, it is a complicated nonlinear problem which cannot be solved by normal algorithm. In this paper, a new prediction scheme is presented to solve this problem by SVM.


### 2.2. Support Vector Machine

As a highly competitive learning method, SVM is gaining popularity in many fields based on the statistical learning theory [30–32]. SVM adopts structural risk minimization principle which has been shown superior to empirical risk minimization principle used by traditional neural networks [24]. Moreover, the generalization ability of SVM is strong [33]. SVM is initially used to solve the classification problem. Assume there is l training sample data denoted as
(6)
D
=
{
(
x
i
,
y
i
)
∣
x
i
∈
R
d
}
i
=
1
l
,
where x
i is an input vector containing multiple features. y
i
∈
{
-
1
,
+
1
} is a class indicator. d is the dimension of sample data. Optimal hyper plane is constructed as
(7)
w
·
x
i
+
b
=
0
,
where w are weights and b is offset argument. The samples on H
1 and H
2 are support vectors. The according equations are w
·
x
i
+
b
=
+
1 and w
·
x
i
+
b
=
-
1, respectively. So, the classification margin is 2
/
∥
ω
∥. For our nonlinear problem, the representation of the sample data has to be changed from the original input space to a higher dimensional space which is referred to as the feature space. This quadratic programming (QP) problem can be expressed as
(8)
min
⁡
Φ
(
w
,
ξ
)
=
1
2
∥
w
∥
2
+
C
∑
i
=
1
l
ξ
i
,
s
.
t
.
m
y
i
[
(
w
·
x
i
)
+
b
]
≥
1
-
ξ
i
,
i
=
1
:
l
.
ξ
i is relaxation factor and C is cost parameter which is a given value. A Lagrange function is constructed to solve the above constrained optimization problem (8) as follows:
(9)
Q
(
w
,
b
,
α
,
β
,
ξ
)
=
1
2
∥
w
∥
2
+
C
∑
i
=
1
l
ξ
i
-
∑
i
=
1
l
α
i
[
c
i
(
x
i
·
w
+
b
)
-
1
+
ξ
i
]
-
∑
i
=
1
l
β
i
ξ
i
,
where α
i and β
i are Lagrange multipliers. In order to get the solution of the original problem, we calculate the partial derivative for different variables as
(10)
∂
Q
(
w
,
b
,
α
,
β
,
ξ
)
∂
w
=
w
-
∑
i
=
1
l
α
i
c
i
x
i
=
0
,
∂
Q
(
w
,
b
,
α
,
β
,
ξ
)
∂
b
=
∑
i
=
1
l
α
i
c
i
=
0
,
∂
Q
(
w
,
b
,
α
,
β
,
ξ
)
∂
ξ
=
C
-
α
i
-
β
i
=
0
.Based on (10), the original optimization problem shown in (9) is transformed to a dual optimization problem as
(11)
max
⁡
J
(
α
)
=
∑
i
=
1
l
α
i
-
1
2
∑
i
=
1
,
j
=
1
l
α
i
α
j
c
i
c
j
K
(
x
i
,
x
j
)
,
s
.
t
.
M
0
≤
α
i
≤
C
,
s
.
t
.
M
∑
i
=
1
l
α
i
c
i
′
=
0
,
i
=
1,2
,
…
,
l
.
K
(
x
i
,
x
j
) is a chosen kernel function which will be discussed later in the prediction scheme section. Thus, we can obtain the optimization w
*
(12)
w
*
=
∑
i
=
1
l
α
i
*
c
i
′
x
i
,
where α
i
* can be solved by (11). And b which does not appear in the dual problem can be calculated through the original constraint. Consider
(13)
b
*
=
1
2
[
max
⁡
c
i
=
-
1
(
〈
w
*
·
x
i
〉
)
+
min
⁡
c
i
=
+
1
(
〈
w
*
·
x
i
〉
)
]
.Therefore, the final prediction output expression can be written as(14)
D
(
l
′
)
=
sign
⁡
(
∑
i
=
1
l
α
i
c
i
K
(
x
i
,
x
j
)
+
b
)
.


## 2.1. Mobile CRN System Model

In this paper, we consider a mobile CRN scenario whereN
c CUs coexist with N
p PUs illustrated in Figure 1. Assume that each P
U
p
(
p
=
1
:
N
p
) has a licensed access to a spectrum c
p with a coverage radius R
p. Thus, the number of PUs is equal to the number of spectrums in the network. Each C
U
c
(
c
=
1
:
N
c
), with an interference radius r, can exploit locally unused licensed spectrum opportunistically without causing any interference to the corresponding P
U
p. Suppose that the CRN assigns spectrums periodically with an allocation interval time T
c which is the interval time between two times of spectrum allocation. We also assume spectrum sensing is ideal in this paper.Figure 1
System model of a mobile CRN.Figure1 gives out an instantaneous snapshot of a mobile CRN deployment with 20 mobile CUs. Two PUs are located in the area. The activity of each P
U
p
(
p
=
2 in Figure 1) is characterized as an on/off (busy/idle) model. The busy time and idle time of P
U
pcan be modeled by the exponential distribution with means α
p and β
p, respectively [26–28]. The probability density function (PDF) can be written, respectively, as
(1)
f
ON
(
t
,
α
p
)
=
1
α
p
e
-
t
/
α
p
,
t
≥
0
,
f
OFF
(
t
,
β
p
)
=
1
β
p
e
-
t
/
β
p
,
t
≥
0
.In this paper, a random mobility model which characterizes the movement of CUs in a two-dimensional space is considered [29]. The movement of each C
U
c consists of a sequence of random length intervals called mobility epochs during which C
U
c moves at a constant speed in a constant direction. And the mobility epoch lengths T
e are independently exponentially distributed with mean 1
/
λ
e. The probability distribution function can be expressed as
(2)
M
e
(
x
)
=
P
(
T
e
≤
x
)
=
1
-
e
-
λ
e
x
.During each epoch, the mobile direction ofC
U
c is uniformly distributed over [
0,2
π
) and the speed of C
U
c is uniformly distributed over [
0
,
v
max
⁡
]. We assume mobility is uncorrelated among all the CUs in a network. And it is reasonable to assume that epoch length, speed, and direction are uncorrelated in the model. Figure 2 shows a mobility trajectory of one given C
U
c as an example.Figure 2
A mobility trajectory example for one givenC
U
c.Definition 1.
Given a licensed spectrumc
p and an instantaneous time t, the instantaneous spectrum availability IS
A
p
c
(
t
) for one C
U
c can be defined as
(3)
IS
A
p
c
(
t
)
=
{
-
1
D
p
,
c
(
t
)
<
R
p
+
r
c
∩
(
α
p
(
t
)
=
-
1
)
1
D
p
,
c
(
t
)
<
R
p
+
r
c
∩
(
α
p
(
t
)
=
1
)
1
D
p
,
c
(
t
)
≥
R
p
+
r
c
.IS
A
p
c
(
t
)
=
1 means that licensed spectrum c
p is instantaneously available at t for C
U
c and IS
A
p
c
(
t
)
=
-
1 means that licensed spectrum c
p is not instantaneous available at t for C
U
c, where D
p
,
c
(
t
) represents the Euclidean distance between P
U
p and C
U
c at t. α
p
(
t
) represents the time-varying working activity of P
U
p, denoted as
(4)
α
p
(
t
)
=
{
1
P
U
p
is
idle
at
t
-
1
P
U
p
is
busy
at
t
.Definition 2.
Given a licensed spectrumc
p and a continuous period T, the continuous spectrum availability CS
A
p
c
(
T
) for one C
U
c can be defined as
(5)
CS
A
p
c
(
T
)
=
{
(
c
,
p
)
∣
IS
A
p
c
(
t
)
=
1
from
t
0
to
t
0
+
T
}
,
where t
0 is a given reference time. CS
A
p
c
(
T
)
=
1 means that spectrum c
p is available to C
U
c not only at t
0 but also at any time between t
0 and t
0
+
T. CS
A
p
c
(
T
)
=
1 means that spectrum c
p is not available to C
U
c at some time between t
0 and t
0
+
T. In practice, T could be a slot or some slots, during which C
U
c can achieve activation and access to the network. Apparently, we focus more on CS
A
p
c
(
T
) because a continuous time period (or a short-time duration) rather than an instantaneous time is more meaningful for OSA or resource allocation in CRN.Our objective is to give out the spectrum mobility prediction for all the CUs based on the joint theoretical analysis of CUs’ mobility and PUs’ working activities under the mobile model. Obviously, it is a complicated nonlinear problem which cannot be solved by normal algorithm. In this paper, a new prediction scheme is presented to solve this problem by SVM.


## 2.2. Support Vector Machine

As a highly competitive learning method, SVM is gaining popularity in many fields based on the statistical learning theory [30–32]. SVM adopts structural risk minimization principle which has been shown superior to empirical risk minimization principle used by traditional neural networks [24]. Moreover, the generalization ability of SVM is strong [33]. SVM is initially used to solve the classification problem. Assume there is l training sample data denoted as
(6)
D
=
{
(
x
i
,
y
i
)
∣
x
i
∈
R
d
}
i
=
1
l
,
where x
i is an input vector containing multiple features. y
i
∈
{
-
1
,
+
1
} is a class indicator. d is the dimension of sample data. Optimal hyper plane is constructed as
(7)
w
·
x
i
+
b
=
0
,
where w are weights and b is offset argument. The samples on H
1 and H
2 are support vectors. The according equations are w
·
x
i
+
b
=
+
1 and w
·
x
i
+
b
=
-
1, respectively. So, the classification margin is 2
/
∥
ω
∥. For our nonlinear problem, the representation of the sample data has to be changed from the original input space to a higher dimensional space which is referred to as the feature space. This quadratic programming (QP) problem can be expressed as
(8)
min
⁡
Φ
(
w
,
ξ
)
=
1
2
∥
w
∥
2
+
C
∑
i
=
1
l
ξ
i
,
s
.
t
.
m
y
i
[
(
w
·
x
i
)
+
b
]
≥
1
-
ξ
i
,
i
=
1
:
l
.
ξ
i is relaxation factor and C is cost parameter which is a given value. A Lagrange function is constructed to solve the above constrained optimization problem (8) as follows:
(9)
Q
(
w
,
b
,
α
,
β
,
ξ
)
=
1
2
∥
w
∥
2
+
C
∑
i
=
1
l
ξ
i
-
∑
i
=
1
l
α
i
[
c
i
(
x
i
·
w
+
b
)
-
1
+
ξ
i
]
-
∑
i
=
1
l
β
i
ξ
i
,
where α
i and β
i are Lagrange multipliers. In order to get the solution of the original problem, we calculate the partial derivative for different variables as
(10)
∂
Q
(
w
,
b
,
α
,
β
,
ξ
)
∂
w
=
w
-
∑
i
=
1
l
α
i
c
i
x
i
=
0
,
∂
Q
(
w
,
b
,
α
,
β
,
ξ
)
∂
b
=
∑
i
=
1
l
α
i
c
i
=
0
,
∂
Q
(
w
,
b
,
α
,
β
,
ξ
)
∂
ξ
=
C
-
α
i
-
β
i
=
0
.Based on (10), the original optimization problem shown in (9) is transformed to a dual optimization problem as
(11)
max
⁡
J
(
α
)
=
∑
i
=
1
l
α
i
-
1
2
∑
i
=
1
,
j
=
1
l
α
i
α
j
c
i
c
j
K
(
x
i
,
x
j
)
,
s
.
t
.
M
0
≤
α
i
≤
C
,
s
.
t
.
M
∑
i
=
1
l
α
i
c
i
′
=
0
,
i
=
1,2
,
…
,
l
.
K
(
x
i
,
x
j
) is a chosen kernel function which will be discussed later in the prediction scheme section. Thus, we can obtain the optimization w
*
(12)
w
*
=
∑
i
=
1
l
α
i
*
c
i
′
x
i
,
where α
i
* can be solved by (11). And b which does not appear in the dual problem can be calculated through the original constraint. Consider
(13)
b
*
=
1
2
[
max
⁡
c
i
=
-
1
(
〈
w
*
·
x
i
〉
)
+
min
⁡
c
i
=
+
1
(
〈
w
*
·
x
i
〉
)
]
.Therefore, the final prediction output expression can be written as(14)
D
(
l
′
)
=
sign
⁡
(
∑
i
=
1
l
α
i
c
i
K
(
x
i
,
x
j
)
+
b
)
.


## 3. Joint Feature Vector Extraction

The common idea is utilizing SVM via domain information such as location and speed directly. However, it does not make good use of the CUs’ mobility characteristic and PUs’ working activities information. The traditional methods, thus, result in low prediction accuracy performance, which will be discussed in the simulation part.In this section,CSA
p
c
(
T
) as joint feature vector is extracted for SVM through theoretical deduction. Obviously, CSA
p
c
(
T
) is related to a period T. In this paper, we focus mainly on spectrum allocation interval time T
c which is meaningful for a real CRN. Two situations need to be investigated in order to derive CSA
p
c
(
T
c
): (1) C
U
c is in the coverage area of P
U
p at t
0 and (2) C
U
c is not in the coverage area of P
U
p at t
0, respectively.For the first situation, letC
U
c predict a period T
p during which C
U
c can use c
p continuously. And our idea is to derive CSA
p
c
(
T
c
) through computing CSA
p
c
(
T
p
). In fact, CSA
p
c
(
T
p
) includes two main situations: (1) C
1
(
T
p
) representing the situation that C
U
c does not move into P
U
p
′ coverage scope between t
0 and t
0
+
T
p and (2) C
2
(
T
p
) representing the situation that C
U
c moves into P
U
p
′ coverage scope at t
0
+
T
s
(
0
≤
T
s
≤
T
p
) while the activity of P
U
p is inactive between t
0
+
T
s and t
0
+
T
p. We believe C
1
(
T
p
) and C
2
(
T
p
) dominate the main situations although other complicated situations as small probability events also exist.C
1
(
T
p
) also contains two parts: (1) P
out
1 representing the situation that the velocity of C
U
c does not change from t
0 to t
0
+
T
p and (2) P
out
2 representing the other situations. Consider
(15)
C
1
(
T
p
)
=
P
out
1
+
P
out
2
.From (2), P
out
1 can be easily obtained as
(16)
P
out
1
=
1
-
M
e
(
T
p
)
=
e
-
λ
e
T
p
.It is difficult to get the accurate value ofP
out
2 because we cannot know the velocity change information (the change in time, speed, and direction) at any time for C
U
c. However, the approximate value E
(
P
out
2
) by estimating P
out
2 can be derived [34]. When T
p
<
T
c, C
U
c has to change its movement speed and direction (or any of them) before t
0
+
T
p, which makes C
U
c away from P
U
p. Therefore, CS
A
p
c
(
T
c
) can be obtained as
(17)
CSA
p
c
(
T
c
)
≈
E
(
P
out
2
)
=
1
λ
e
T
p
+
ε
a
+
e
-
λ
e
T
p
(
1
2
p
away
λ
e
T
p
-
1
λ
e
T
p
-
ε
a
-
1
)
,
where p
away denotes the probability that C
U
c moves away from P
U
p after the first velocity (speed and direction) change. In practice, ε
a
≥
0 represents other situations (small probability events except the situations discussed above). For example, C
U
c changes its speed three times while C
U
c still does not move into P
U
p’s coverage scope from t
0 to t
0
+
T
c. ε
a is used to balance the equation and we will discuss it later.WhenT
p
≥
T
c, CS
A
p
c
(
T
c
) for C
U
c can be obtained as
(18)
CSA
p
c
(
T
c
)
≈
C
1
(
T
c
)
+
E
(
P
out
2
)
=
1
λ
e
T
c
+
ε
a
+
e
-
λ
e
T
c
(
1
2
p
away
λ
e
T
c
-
1
λ
e
T
c
-
ε
a
)
.For the second situation, the movement ofC
U
c and the working state of P
U
p should be investigated simultaneously. Different from the first situation, we believe that the prediction of the idle state for P
U
p is more essential due to the original position of C
U
c. Similar to the first situation, let C
U
c predict a continuous period T
p
out that C
U
c will not move out of P
U
p’s coverage boundary from t
0 to t
0
+
T
p
out. It is noted that T
p
out is different from the T
p mentioned above.WhenT
p
out
<
T
c, CS
A
p
c
(
T
c
) for C
U
c can be obtained as
(19)
CSA
p
c
(
T
c
)
=
p
in
·
∫
t
0
t
0
+
T
p
out
f
OFF
(
t
,
β
p
)
d
t
+
ε
in
.Similar toε
a above, ε
in is used to denote all the other small probability events. ∫
t
0
t
0
+
T
p
out
f
OFF
(
t
)
d
t represents the idle probability of c
p between t
0 and t
0
+
T
p
out. p
in represents the probability that C
U
c moves out of P
U
p
′ coverage boundary before t
0
+
T
p. p
in consists of two parts. P
in
1 denotes the situation that the velocity of C
U
c remains unchanged from t
0 to t
0
+
T
p. And P
in
2 denotes the other situations. P
in can be easily obtained as
(20)
P
in
=
1
λ
e
T
p
out
+
ε
b
+
e
-
λ
e
T
p
(
1
2
p
b
λ
e
T
p
out
-
1
λ
e
T
p
out
-
ε
b
)
,
where ε
b
≥
0 tries to represent all the other situations. p
b represents the probability that C
U
c moves away from P
U
p after the first change in velocity. According to (1), (19), and (20), CS
A
p
c
(
T
c
) for C
U
c can be obtained as
(21)
CS
A
p
c
(
T
c
)
=
(
1
λ
e
T
p
out
+
ε
b
+
e
-
λ
e
T
p
out
(
1
2
p
b
λ
e
T
p
out
-
1
λ
e
T
p
out
-
ε
b
)
)
×
(
e
-
μ
p
t
0
-
e
-
1
/
β
p
·
(
t
0
+
T
p
out
)
)
+
ε
in
.WhenT
p
out
≥
T
c, CS
A
p
c
(
T
c
) is mainly determined by P
U
p’s working activity. Thus, CS
A
p
c
(
T
c
) for C
U
c can be obtained as
(22)
CS
A
p
c
(
T
c
)
=
∫
t
0
t
0
+
T
c
f
OFF
(
t
,
β
p
)
d
t
+
ε
c
=
e
-
1
/
β
p
·
t
0
-
e
-
1
/
β
p
·
(
t
0
+
T
c
)
+
ε
c
.
ε
c denotes all the other spectrum availability situations. Thus, we obtain joint feature vector sets S
i
c
=
{
CS
A
p
c
(
T
c
)
i
}
i
=
1
l according to different situations based on (17), (18), (21), and (22). Moreover, we can get the ultimate prediction expression according to (14)
(23)
D
(
l
′
)
=
sign
⁡
(
∑
i
=
1
m
α
i
c
i
′
K
(
S
i
c
,
x
j
)
+
b
)
,
s
.
t
.
S
i
c
=
{
CS
A
p
c
(
T
c
)
i
}
i
=
1
l
.


## 4. Spectrum Mobility Prediction Scheme

In this section, a new SVM-based spectrum mobility prediction scheme is proposed based on the analysis and deduction above. The main steps of the proposed prediction scheme are as follows.Step 1 (CRN initialization).
Initialize the original locations of PUs and CUs randomly in the two-dimensional deployment area. The coordinates of PUs are not changed once generated. And PUs’ initial working states are stochastic. Initialize the original speed, direction, and epoch lengths for eachC
U
c. Assume the maximum velocity for CUs is v
max
⁡. The beginning time of the system is set to t
0. The parameters C, ξ
i of SVM are initialized. Simulations are based on many times to make sure of the accuracy of the result. In addition, set T
c, α
p, β
p, ε
away, ε
a, ε
b, ε
c, p
away, p
b
λ
e, R
p, and r
c.Step 2 (operate the mobile CRN model).
PUs’ working states obey an exponential on/off model. The PDF satisfies (1). And the mobility of CUs follows the mobile model mentioned in Section 2.1. The mobility epoch lengths are independently exponentially distributed with mean 1
/
λ
e. It is noted that wrap-around technique is adopted during simulation in order to make the total number of SUs unchanged in the simulation area.Step 3 (calculate the joint feature vectorsS
i
c for SVM).
Here, there are three situations to be investigated. Firstly,C
U
c does not move into the coverage of P
U
p at t
0 granted that C
U
c moves with v
max
⁡ towards P
U
p. Secondly, C
U
c is out of the coverage of P
U
p at t
0, but C
U
c may move into the coverage of P
U
p between t
0 and t
0
+
T
c. Finally, C
U
c is in the coverage of P
U
p at t
0. The detail calculation steps for S
i
c are described in Algorithm 1.Algorithm 1:Joint feature vectors extraction for C
U
c.
Calculation steps ofS
i
c
ifD
p
,
c
(
t
0
)
≥
R
p
+
r
c
+
v
max
⁡
·
T
c
Spectrum c
p is available for C
U
c.
else ifR
p
+
r
c
≤
D
p
,
c
(
t
0
)
<
R
p
+
r
c
+
v
max
⁡
·
T
c
if T
p
<
T
c
Calculate CS
A
p
c
(
T
c
) by (17).
else
Calculate CS
A
p
c
(
T
c
) by (18).
end
else if0
<
D
p
,
c
(
t
0
)
<
R
p
+
r
c
ifT
p
out
<
T
c
CalculateCS
A
p
c
(
T
c
) by (21).
else
CalculateCS
A
p
c
(
T
c
) by (22).
end
end
The vectorsS
i
c are constructed for SVM.Step 4 (execute prediction by SVM).
Firstly, a SVM prediction model is generated according to the history input vectorsS
i
c from Step 3. Secondly, put the data to be predicted into the generated SVM model. Then, compute the prediction results and record the results. Here, we adopt the RBF kernel as mapping function for SVM in simulation. Because the RBF kernel function tends to obtain more robust results than other kernels and can reduce numerical difficulties, the RBF kernel function can be defined as
(24)
K
(
x
,
y
)
=
exp
⁡
(
-
γ
∥
x
-
y
∥
2
)
,
γ
>
0
.Step 5 (the system resets).
Execute Steps1 to 4 until simulation numbers are satisfied for testing. Then, the operation stops. Compute the prediction performance: the prediction accuracy rate p
accuracy and the miss detection probability p
miss. p
accuracy is defined as
(25)
p
accuracy
=
|
{
i
∣
y
i
′
·
f
(
x
i
′
)
>
0
}
|
l
′
×
100
%
,
where {
x
i
′
}
1
l
′ are testing data which are to be predicted. And y
i
′
∈
{
-
1
,
+
1
} are true labels for testing data. l
′ is the total number of testing data. f
(
x
i
′
)
∈
{
-
1
,
+
1
} are the predicted decision values. Here, {
-
1
,
+
1
} represents the busy/idle working activity for a given PU. |
·
| represents the element numbers for a given set. Actually, p
accuracy reflects the accuracy degree of spectrum prediction mechanism. The higher the p
accuracy is, the better the prediction effect is.In addition, the miss prediction ratep
miss (the rate that the spectrum is predicted to be idle while it is actually busy) is investigated for the proposed prediction mechanism. Because p
miss can reflect the actual interference to the PUs to some extent. The smaller the p
miss is, the better the prediction mechanism is. p
miss can be defined as
(26)
p
miss
=
|
{
i
∣
y
i
′
·
f
(
x
i
′
)
<
0
,
f
(
x
i
′
)
=
1
}
|
l
′
×
100
%
.Note thatp
accuracy
+
p
miss
≤
100
%.


## 5.Simulation Results and Analysis

In this section, experimental results of the prediction performances for our proposed scheme are investigated. Simulation parameters are shown in Table1. We compare the proposed prediction mechanism with the traditional prediction schemes (SVM with initial location coordinates of CUs and SVM with initial location coordinates and speed of CUs) to evaluate the prediction performances under different parameters.Table 1
Simulation parameters.
Parameter
Value
Total simulation number for testing
1000
Simulation area
5000 m × 5000 m
R
p
1000 m
r
c
500 m
Kernel function
RBF kernel
C
10
ξ
i
0.01
T
c
1 s~15 s
α
p
1/3 s
β
p
1/3 s
p
a
=
p
b
=
p
away
0.5
ε
a
=
ε
b
=
ε
c
=
ε
in
=
ε
away
0~0.2
1
/
λ
e
3 s
CUs’ maximum velocityv
max
⁡
0 m/s~50 m/s
Total number of PUs
2
Total number of training CUs
20~240
Total number of testing CUs
1000Note that we assumeε
a
=
ε
b
=
ε
c
=
ε
in
=
ε
away during simulation for simplicity, because they are very small positive values that are set to balance the according equations. In addition, the total testing number is set to 1000 in order to avoid randomness during simulation.Figure3 shows p
accuracy among different algorithms versus training node number. The proposed SVM-SMP converges at about 40 training data faster than SVM-location algorithm (SVM-LA) with a convergent result at about 100 training data. p
accuracy of SVM-location-speed algorithm (SVM-LSA) is much worse than the other comparison algorithms which shows that the initial speed parameters have a bad effect on the prediction performance. It is caused by the time-varying characteristic of CUs’ velocity (speed or direction).Figure 3
Prediction accuracy ratep
accuracy for CUs versus training node number.As shown in Figure4, p
accuracy decreases with the increasing of T
c for the three different algorithms. p
accuracy of the proposed SVM-SMP is better than SVM-LA when T
c is relatively small (
1
≤
T
c
≤
4.5
). However, p
accuracy of SVM-SMP is worse than SVM-LA when T
c is big enough (T
c
>
4.5). It is because the proposed prediction scheme is based on the short-time prediction idea according to the feature vector extraction analysis in (17), (18), (21), and (22). Moreover, wrap-around technique makes CUs stay at their original positions with big probability at the simulation boundary. Thus, SVM-LA decreases not that fast with the increasing of T
c. And the SVM-SMP works well when the prediction time is not long and vice versa. Note that the short-time prediction performance is mainly focused on in this paper because CR itself should achieve communication in a very short time.Figure 4
Prediction accuracy ratep
accuracy for CUs versus T
c.As illustrated in Figure5, p
miss is studied versus T
c for different algorithms. p
miss of SVM-SMP is nearly equal to 0 when T
c is small (
1
≤
T
c
≤
5
), which is better than SVM-LA. However, p
miss of SVM-SMP increases very fast when T
c is big enough. Figure 5 shows the good short-time miss prediction rate characteristics of the new algorithm which is very essential to CR.Figure 5
Miss prediction ratep
miss for CUs versus T
c.In Figures6 and 7, p
accuracy and p
miss versus v
max
⁡ are investigated between SVM-SMP and SVM-LA. From Figure 6, p
accuracy of SVM-SMP is better than that of SVM-LA when 1
≤
T
c
≤
4
s. However, p
accuracy of SVM-SMP is worse than that of SVM-LA when T
c
=
5
s and v
max
⁡
>
42
m
/
s. It shows that the proposed SVM-SMP lose the advantages when the prediction time and speed are too big simultaneously. As shown in Figure 7, p
miss of SVM-SMP is less than 0.1
%. Comparatively, p
miss of SVM-LA is approximately 1
%. Thus, SVM-SMP shows good p
miss performance with v
max
⁡ changing.Figure 6
Prediction accuracy ratep
accuracy for CUs versus v
max
⁡.Figure 7
Miss prediction ratep
miss for CUs versus v
max
⁡.In Figures8 and 9, we investigate p
accuracy and p
miss versus λ between SVM-SMP and SVM-LA. From Figure 8, p
accuracy of SVM-SMP decreases obviously with the increasing of λ when v
max
⁡ is big (such as 50
m
/
s). However, p
accuracy of SVM-SMP does not change very obviously with the increasing of λ when v
max
⁡ is small (such as 10
m
/
s). It is due to the fact that the bigger the λ is, the stronger the irregular movements of CUs are. Thus, it is difficult for the prediction when CUs are moving with high speed and strong irregular movements. As shown in Figure 9, p
miss of SVM-SMP is much better than that of SVM-LA when v
max
⁡ is small (such as 10
m
/
s, 30
m
/
s
). However, p
miss of SVM-SMP is worse than that of SVM-LA when v
max
⁡
=
50
m
/
s and λ
>
13, which validates the performance degradation of the prediction performance again when v
max
⁡ is relatively big with strong irregular movements. It is because SVM-SMP is based on the assumption of weak irregular movements for CUs.Figure 8
Prediction accuracy ratep
accuracy for CUs versus λ.Figure 9
Miss prediction ratep
miss for CUs versus λ.In Figures10 and 11, p
accuracy and p
miss versus β
p are investigated for SVM-SMP and SVM-LA. In Figure 10, p
accuracy of SVM-SMP is obviously better than p
accuracy of SVM-LA when the prediction time is short such as 1 s and 3 s. However, p
accuracy of SVM-SMP is worse than p
accuracy of SVM-LA when the prediction duration time is T
c
=
5
s and the mean idle time is β
p
<
4. In Figure 11, p
miss of SVM-SMP is nearly equal to 0, which is much better than SVM-LA. In addition, the prediction performance (
p
accuracy and p
miss
) does not improve significantly for the two algorithms with the increasing of β
p when β
p is big enough according to Figures 10 and 11.Figure 10
Prediction accuracy ratep
accuracy for CUs versus μ.Figure 11
Miss prediction ratep
miss for CUs versus μ.Figure12 shows the impact of ε on the prediction accuracy rate p
accuracy for SVM-SMP. When λ
=
1, the maximum of p
accuracy occurs at about ε
=
0 which is relatively small. With the increasing of λ, the maximum value position of p
accuracy moves to the right. When λ
=
10, the maximum of p
accuracy occurs at about ε
=
0.1. It is because the small probability events happen more times when SUs’ randomness movements are strong (λ is big). The bigger the λ is, the bigger the maximum value position of p
accuracy occurs for ε. Therefore, we can obtain better prediction performance by adjusting ε for randomness movements of different strength.Figure 12
Prediction accuracy ratep
accuracy for CUs versus ε.As shown in Figure13, miss prediction rate p
miss is studied versus ε for SVM-SMP. When λ
=
5 and λ
=
10, the minimum of p
miss occurs at about ε
=
0.07 and ε
=
0.1, respectively. It shows that different optimal ε corresponds to SUs’ randomness movements of different strength for p
miss. The simulation results further confirm the impact of ε on the prediction accuracy rate in Figure 12.Figure 13
Miss prediction ratep
miss for CUs versus ε.


## 6. Conclusions

In this paper, a new spectrum mobility prediction algorithm is proposed in mobile CRNs. SVM theory is adopted to improve the spectrum mobility prediction performance, which takes into account time- and space-varying characteristics together. Moreover, new extracted feature vectors based on the theoretical analysis are input into SVM. Simulation results confirm that the convergence speed of our SVM-SMP is faster than SVM-LA and SVM-LSA. Meanwhile, SVM-SMP shows better short-time prediction performance than SVM-LA and SVM-LSA, which is essential to real mobile CRNs. In addition, the prediction performance degradation caused by SUs’ high speed and strong randomness movements can be made up by choosing the proper parameters.As known to us, how to choose the best parameters (C and ξ
i) quickly is still an open problem in SVM. We will further analyze the impact of ε on prediction performance. It leaves us to investigate in the future.



---

*Source: 395212-2014-03-30.xml*