Beruflich Dokumente
Kultur Dokumente
Prioritized Traffic
Vamsi Krishna Tumuluru, Ping Wang, and Dusit Niyato
Center for Multimedia and Network Technology (CeMNeT)
School of Computer Engineering, Nanyang Technological University, Singapore.
AbstractDynamic spectrum access (DSA) is an important design aspect for the cognitive radio networks. Most of the existing
DSA schemes are to govern the unlicensed user (i.e., secondary
user) traffic in a licensed spectrum without compromising the
transmissions of the licensed users, in which all the unlicensed
users are typically treated equally. In this paper, prioritized
unlicensed user traffic is considered. Specifically, we prioritize
the unlicensed user traffic into two priority classes (i.e., high
and low priority). Two different DSA policies are proposed to
manage the handoff for prioritized unlicensed user traffic (i.e.,
reassigning new channels to the secondary users which paved
way for licensed user). These two policies are different in which
one allows to drop the ongoing low priority secondary users to
accommodate more high priority secondary users being replaced
by the presence of licensed user while the other does not allow
that. We also study the impact of sub-channel reservation for
the high priority secondary users in both DSA policies. Both
DSA policies are analyzed using Markov chain. For performance
measures, we derive the blocking probability, the probability of
forced termination and the throughput for both high and low
priority unlicensed users. The numerical results are verified using
simulations.
I. I NTRODUCTION
In recent years, several spectrum surveys have been conducted to understand the spectrum utilization in the licensed
and unlicensed portions of the radio spectrum [1], [2]. These
surveys revealed that under the present spectrum regulatory
policies, major portions of the licensed spectrum are underutilized for most of the time, while the unlicensed spectrum
is heavily used and is often insufficient. Among the efforts to
improve the overall spectrum utilization, the concept of cognitive radio is gaining much importance [3]. The cognitive radio
network (CRN) is composed of licensed users and unlicensed
users sharing the licensed spectrum. In most cases, the licensed
users (also called primary users) are oblivious of the existence
of the unlicensed users (also called secondary users). In the
CRN, the secondary users are allowed to dynamically access
unused channels (i.e., frequency bands) in the primary user
spectrum, thereby improving the overall spectrum utilization.
Secondary user transmissions in the CRN can be effectively
managed by a dynamic spectrum access (DSA) policy. Using
the DSA policy, the secondary users are assigned unused
channels in the primary user spectrum. In the event of a
primary users arrival, the secondary users transmissions on
spectrum is shared by the PUs and SUs. The PUs have the
highest priority in accessing the channels. The secondary users
are classified into two priority classes. The high priority SUs
are denoted as SU1 while the low priority SUs are denoted as
SU2 . Similar to [4], we assume that a central controller exists
to implement the DSA policy. The objective of the DSA policy
is to assign idle sub-channels to the incoming SU calls, and
moderate their handoff. We consider two DSA policies for our
system model. They are denoted as DSA-C1 and DSA-C2.
sub-channel
1
N(M-1)+1
MN
channel
l i, m j and l + m {0, 1, . . . , N }
r = M N Y (N (l + m)) and r 0
s = (l + m) min(r, l + m) .
Licensed spectrum
Fig. 1. System model.
(1)
li,j,k
0 ,m0 =
Rl0 ,m0
p .
(2)
The performance measures for each DSA policy are expressed using the steady state probability distribution of its
corresponding CTMC. We derive performance measures (for
both SU1 and SU2 calls) such as blocking probability, probability of forced termination, and throughput.
Let z denote the steady state distribution of a CTMC
whose state is denoted as z = [i, j, k]. To simplify the
presentation, we use the same notations under all DSA policies.
For any DSA policy, the corresponding steady state probability
distribution z is obtained by finding the corresponding transition rate matrix Q and applying the Gauss-Seidel algorithm
[10]. Each row of Q represents the transitions with respect to
a specific state z, as a balance equation. For example, referring
to Fig. 2, one balance equation with respect to the state [i, j, k]
under the DSA-C1 policy is expressed as follows:
i 1, j , k
k p
(i + 1) 1
i, j , k
1 2
2 2
j 2
( j + 1) 2
j,k
li,, m
i l , j m , k + 1
Fig. 2.
i + 1, j , k
i1
i, j 1, k
3 p
i, j + 1, k
[kp + 2 2 + 1 + p + i1 + j2 ] [i,j,k] =
p [i,j,k1] + (j + 1)2 [i,j+1,k] + (i + 1)1 [i+1,j,k] +
(k + 1)p [i,j,k+1] + 1 [i1,j,k] + 1 2 [i,j1,k]
(3)
( k + 1) p
i, j , k + 1
Y M N
z
il0 , jm0
l0 li,j,k
0 ,m0 z
1 (1 PB1 )
(4)
In Eq. (4), the numerator denotes the rate that l0 SU1 calls
are terminated in state z whereas the denominator denotes the
PF 2 =
z
il0 , jm0
2 (1 PB2 )
(5)
A. Blocking Probabilities
The blocking probabilities corresponding to the DSA-C2
policy are same as that corresponding to the DSA-C1 policy
(because the DSA policies only differ in the handoff mechanism), and hence they are not shown for brevity of paper.
Fig. 3 shows the blocking probabilities of the SU1 and SU2
calls under the DSA-C1 policy with various PU arrival rate
(p ). The following parameters are chosen for this experiment:
1 = 0.4, 2 = 0.4, p [0.03, 0.12], 1 = 0.8, 2 = 0.8,
p = 0.09, and = 2. It can be seen that all the blocking
probabilities (i.e., for both SU classes) increase as the PU
arrival rate increases. This is because the number of busy
sub-channels increases with an increase in the PU arrival
rate, resulting in higher blocking probabilities for the SUs.
Fig. 3 also shows that the analysis results match well with the
simulation results.
DSA-C1 (a)
0.08
DSA-C1 (s)
DSA-C2 (a)
0.07
DSA-C2 (s)
0.06
0.05
0.04
0.03
0.02
0.01
0
0.02
0.03
0.04
0.05
0.06
0.07
0.08
0.09
0.1
0.11
0.12
PU arrival rate, p
Fig. 4. Forced termination probability of SU1 calls under both DSA policies.
0.08
0.09
DSA-C1 (a)
0.07
DSA-C1 (s)
DSA-C2 (a)
0.06
DSA-C2 (s)
0.05
0.04
0.03
0.02
0.01
0
0.02
0.03
0.04
0.05
0.06
0.07
0.08
0.09
0.1
0.11
0.12
PU arrival rate, p
Fig. 5. Forced termination probability of SU2 calls under both DSA policies.
0.14
0.12
0.05
0.1
0.08
0.06
0.04
0.02
0
0.02
0.03
0.04
0.05
0.06
0.07
0.08
0.09
0.1
0.11
0.12
PU arrival rate, p
Fig. 3.
Blocking probabilities of SU1 and SU2 calls under both DSA
policies.
DSA-C1 (a)
0.045
DSA-C1 (s)
DSA-C2 (a)
0.04
DSA-C2 (s)
0.035
0.03
0.025
0.02
0.015
0.4
0.6
0.8
1.2
1.4
1.6
1.8
S U1 arrival rate, 1
V. C ONCLUSION
We have investigated the dynamic spectrum access in the
cognitive radio networks under a special case in which the SU
traffic is prioritized. Two different DSA policies have been
developed to handle the spectrum assignment and handoff for
the SU traffic with two priority classes. We have developed the
analytical models for two proposed DSA policies. For performance evaluation, we have derived the blocking probability,
the forced termination probability, and the throughput for the
two priority classes of SU traffic. We have also investigated the
case of sub-channel reservation for the high priority SUs and
obtained the optimal sub-channel reservation. The analytical
results have been verified through simulations.
R EFERENCES
[1] Federal Communications Commission, Spectrum policy task force, in
Rep. OET Docket No. 02-135, Nov.2002.
[2] S. D. Jones, E. Jung, X. Liu, N. Merhab and I-J. Wang, Characterization
of spectrum activities in the U.S. public safety band for opportunistic
spectrum access, in 2nd International Symposium on New Frontiers in
Dynamic Spectrum Access Networks (DySPAN),pp. 137146, April 2007.
[3] S. Haykin, Cognitive radio: Brain-empowered wireless communications, in IEEE Journal on Selected Areas in Communication, vol. 23,
no. 2, pp. 210230, 2005.
[4] E. W. M. Wong and C. H. Foh, Analysis of cognitive radio spectrum
access with finite user polulation, in IEEE Communications Letters, vol.
15, no. 5, pp. 294296, May 2009.
[5] X. Zhu, L. Shen and T-S. P. Yum, Analysis of cognitive radio spectrum
access with optimal channel reservation, in IEEE Communications
Letters, vol. 11, no. 4, pp. 304306, April 2007.
[6] Y. Zhang, Dynamic spectrum access in cognitive radio wirless networks, in IEEE International Conference on Communications, pp.
49274932, May 2008.
[7] S. M. Kannappa and M. Saquib, Performance analysis of a cognitive
network with dynamic spectrum assignment to secondary users, in IEEE
International Conference on Communications, pp. 15, July 2010.
[8] U. Wiggins, R. Kannan, V. Chakravarthy and A. V. Vasilakos, Datacentric prioritization in a cognitive radio network: A quality-of-service
based design and integration, in 3rd IEEE Symposium on on New
Frontiers in Dynamic Spectrum Access Networks (DySPAN), pp. 111,
Oct. 2008.
[9] C. Gosh, S. Chen, D. P. Agarwal and A. M. Wyglinski, Priority-based
spectrum allocation for cognitive radio networks employing NC-OFDM
transmission, in IEEE Military Communications Conference, pp. 15,
Oct. 2009.
[10] W. J. Stewart, Introduction to the numerical solution of Markov chains,
Princeton University Press, 1994.
0.13
DSA-C1 (s)
0.12
DSA-C2 (s)
0.11
0.1
0.09
0.08
0.07
0.06
0.05
0.04
D. Throughput Evaluation
We verify the throughput calculated in the analysis with
the simulation results. For the simulation, the throughput for
a given SU priority class is calculated by taking the ratio of
the total number of SU calls corresponding to that priority
class completing service, to the total duration of the simulation.
In our simulations, call arrivals are generated for a duration
of 800000 time units. For the parameter setting 1 = 1.8,
2 = 1.8, p = 0.3, 1 = 0.3, 2 = 0.06, p = 0.4 and
= 0, we obtained the following values for the throughput