2008 International Conference on Computer Science and Software Engineering

Research on the Routing Algorithm Based on QoS

Requirement for Cognitive Radio Networks
Qing He1, Huaibei Zhou2
1
School of Computer, Wuhan University, 430072, Wuhan, China
2
International Software School, Wuhan University, 430072, Wuhan, China
E-mail: Hoyden1982@163.com

Abstract—Cognitive radio network has received increasing
attention in recent few years. Cognitive radio network is viewed
as a novel network for improving the utilization of a precious
natural resource: the radio electromagnetic spectrum. This paper
first gives a general overview of the background and concept of
cognitive radio network. Then we focus on the routing algorithm
based on the QoS requirement. In this paper, the characteristic of
QoS requirement and the mathematical model of cognitive radio
network are investigated. Finally, a novel term s which considers
the effect of the bandwidth and the delay is introduced. We can
take into account the term s for the QoS requirement of each
session in future work, which means just a fixed value of s, rather
than the bandwidth and the delay, will be requested when we
provide our QoS requirement for a session.
design is that we can take into account the term s for the QoS
requirement of each session in future work. That means we can
just request a fixed value of s rather than the bandwidth and the
delay when we provide our QoS requirement for a session.
Additionally, this design also considers the transmission range
and the interference range. So it meets the characteristic of the
cognitive radio network.
The rest of the paper is organized as follows. The related
work is reviewed in Section II. The routing algorithm based on
QoS requirement is also presented in Section II. Section III
contains our experimental evaluation. In Section III we
introduce our simulation condition carefully. Finally, we draw
our conclusions in Section IV.

Keywords- Cognitive radio network;load balanc ing;QoS routing

II. RELATED WORK

I. INTRODUCTION
Most of today’s radio systems are not aware of their radio
spectrum environment and operate in a fixed frequency band
using a specific spectrum access system. Investigations of the
spectrum utilization indicate that not all the spectrum is used
in space. However, a large portion of the assigned spectrum is
used sporadically and geographical variations in the utilization
of assigned spectrum ranges from 15% to 85% with a high
variance in time. The limited available spectrum and the
inefficiency in the spectrum usage necessitate a new
communication paradigm to exploit the existing wireless
spectrum opportunistically. Cognitive radio network is
proposed to solve these current spectrum inefficiency
problems. The term ‘‘cognitive radio’’ is proposed by Mitola
in [11] firstly.
On one hand, opportunistic spectrum access can improve
the overall spectrum efficiency. And on the other, the augment
Before we implement the process of the routing algorithm
based on the QoS requirement ， we must know the
characteristic of the cognitive radio network and the QoS
requirement. In this section, we will introduce three parts: the
mathematical modeling of cognitive radio network, the QoS
requirement and the algorithm of Dijkstra.
A. The Mathematical modeling of cognitive radio
network
We suppose that band m is available at both node i and
node j, denote xij( m,k ) = 1, If node i transmits data to node j on
( m,k )
sub-band(m,k); otherwise xij = 0[3]. We should note that
node i cannot transmit to multiple nodes on the same frequency
sub-band. So we have

∑x
of transmission from cognitive network can cause some ( m,k )
serving nodes may be broken down. That motivates our iq ≤1 (1)
objective of trying to route packets along the optimal path to q∈Ti m
reach the minimum delay and the maximum bandwidth.
Meanwhile, we should also ensure the QoS requirement. Also node i cannot use the same frequency sub-band for
In this paper, we present our design of routing algorithm transmission and reception, due to ‘self-interference’ at the
based on the QoS requirement for the cognitive radio network. physical layer.

∑
In this algorithm we assume that the distance between two
nodes is directly proportional to the bandwidth, and inversely That is,
x ij( m , k ) + x (jqm , k ) ≤ 1 (2)
proportional to the delay. Then we introduce the term s which q∈T j
m

considers the effect of the bandwidth and the delay. We

choose the optimal path with the algorithm of Dijkstra. The At the network layer, a source node may need a number of
span of each link equals s. The main contribution of our relay nodes to route the data stream toward its destination node.

978-0-7695-3336-0/08 $25.00 © 2008 IEEE 1114

DOI 10.1109/CSSE.2008.1531
Clearly, a route having a single path may be overly restrictive B. The QoS requirement
and is not able to take advantage of load balancing. A set of
At first we assume that the network is defined as a
paths (or multi-path) is more flexible to route the traffic from a
source node to its destination. Mathematically, this can be weighted map G=（V，E）. V means the set of all nodes，E
modeled as follows. means the set of the limited network links. We assume
|V|=n，|E|=t. b(i,j) is the link bandwidth of the link (i, j). de(i,j)
If node i sends data to node j on sub-band (m,k), is the link delay of the link(i,j).b(i,j) also includes the
( m,k )
i.e., xij = 1 , then the capacity of link (i,j) in sub-band (m,k) description of the spectrum resources[2]. D is the delay measure.
So we can describe a request for QoS routing as R=（S，B，
is
D，A）. S is the source node of the service request. D is the
pg ij Q destination node of the service request. B is the minimum
cij( m ,k ) = u ( m,k ) w( m ) log 2 (1 + ) (3) bandwidth requirements of this service request [1,6]. D is the
a smallest delay which is required. We assume that:
Where a is the ambient Gaussian noise density [5,10]. So mi , j = {1, (i, j ) ∈ p;0, (i, j ) ∉ p} (8)
K (m) pg ij Q
bandwidth( p) = ∑ ∑x ( m ,k )
ij u ( m ,k )W ( m ) log 2 (1 +
a
) ≥ B (4) P is an optional path from the source node S to the
m∈M ij k =1 destination node D.
bandwidth(p) means the bandwidth of the path P. So we can introduce the bandwidth of the path P is
bandwidth(p) and the delay of the path P is delay(p) [7,8,9].
M i means the set of available bands at a cognitive radio n n
network node i. Delay(p)= ∑ i∑ de i, j mi , j i=1,2,`````,n j=1,2….t （9）
M ij = M i ∩ M j , M ij means the set of available bands i =1 j =1

for link (i,j).
pg ij means the propagation gain from node i to node j.
For the transmission from node i to node j, a widely-used
model of the propagation gain pgij is:
−n
pg ij = d ij
In (5) dij is the physical distance between nodes i and j, n is the
path loss index.
In this paper, it is determined a data transmission from
node i to node j is successful only if the received power at
node j exceeds a power threshold defined as ps. Moreover, it is
supposed that the transmission power of node i is p and the
transmission range of this node is denoted as Rt (p). Based on
dij·p ≥ ps and (1), when dij·p = ps, pgij = Rt (p). The
transmission range of this node is:
1
⎛ p ⎞ n
R t ( p ) = ⎜⎜ ⎟⎟
⎝ ps ⎠
Similarly, it is assumed that an interference power is
negligible only if it cannot exceed a threshold defined as pf at
a receiver. Denote the interference range of a node as RI (p).
Then we can infer that the interference range of a node is:
1
⎛ p ⎞
RI ( p ) = ⎜ ⎟ （7）
⎜p ⎟
⎝ f ⎠
Since pf < ps, RI (p) > Rt (p). It is inferred that the
interference range is greater than the transmission range at a
node.
We should know how to decide which path is the best
one. So we introduce a new term bd. At first we need to
calculate all of bd for each path. Then we find the maximum
of bd. This path is the best path, if its bd is the maximum.
bandwidth( pi )
bd i = MAX [ ]
delay( pi ) i=1,2…n. (10)
（5）
Where n is the number of all successful paths.
Pi means one of the successful paths.
In this case, we can reach a balance point between the
bandwidth and the delay, to find the optimal path. Therefore,
we should find out all of the successful paths from the source
node to the destination node at first. Then we need to find out
the path which holds the largest bd. This path is the optimal
path to meet the QoS requirement.
We assume that the distance between two nodes is
directly proportional to the bandwidth, and inversely
proportional to the delay. Taking into account the
（6） characteristics of cognitive radio network and the complexity
to simulate the real cognitive radio network, we corresponding
simplified the condition of the network. If the distance
between two nodes excess the interference distance, the
bandwidth will be zero and the delayed will be the infinite.
With the reduction in distance, the bandwidth will increase.
With the reduction in distance, the delay will decrease.
n At now we will introduce the algorithm of Dijkstra.
C. The algorithm of Dijkstra
We choose the optimal path with the algorithm of
Dijkstra. This algorithm describes a concept of minimum
spanning tree. The theory can be use in teaching net-work, like
the paths of router and router [4, 12]. It goes from a start node,
and then it will begin to run follow steps:
1. Finding the connected node.

1115
 2. Calculating the sum of start node to next node.
3. Choosing the least sum of node as start point next
round and avoiding account for loop.
It will cycle the three steps until finishing the spanning
tree.
When we use the algorithm of Dijkstra, the span between
two nodes equal s.
bandwidth( i , j )
s( i , j ) = (11)
delay(i , j )
bandwidth(i,j) means the transmission bandwidth from
node i to node j.
delay(i,j) means the transmission delay from node i to node
j.
We will build an array to storage all the s for each
successful path. Then we find out the optimal path. In next Fig 1 A 40-nodes wireless network
section, we will introduce our experimental environment in
The figure 1 shows the network topology. It is gained that
detail.
each session is active. The source node of session 1 is
S1(10,10). The QoS requirement of session 1 is
III. SIMULATION (Bandwidth ≥ 0.3 and Delay ≤ 0.6). The destination node of
In this section, simulation results are presented to session 1 is D1(50,40). So the maximal relay distance is 30m.
demonstrate the performance of our algorithm. We consider That means the distance of any two neighboring nodes in
N= 40 nodes randomly deployed in a 300×300m area. The session 1 would not be longer than 30m.
units for distance, the bandwidth, and the delay are all We suppose that every node adopt the maximum
normalized with appropriate dimensions. Among these nodes, transmission power. In this experiment, the interference range
there are L= 8 active sessions, with source node and is twice of the transmission range. The ultimate goal is to
destination node of each session randomly selected. And we discover the optimal path. Taking into account the bandwidth
have set a QoS requirement for every session. The QoS and the delay are related with the distance. The bandwidth and
requirements of all sessions are illustrated in Table 1. the delay of different distance are illustrated in Table 2.

TABLE I. THE QOS REQUIREMENT TABLE II. THE BANDWIDTH AND THE DELAY

Source Destination Bandwidth Delay Distance Bandwidth Delay

node node (Mbps) (sec) (Mbps) (sec)
(10,10) (50,40) 0.3 0.6 (0,10] 0.8 0.2
(10,97) (104,140) 0.2 0.6 (10,20] 0.7 0.3
(33,60) (107,57) 0.2 0.9 (20,30] 0.5 0.6
(68,85) (95,120) 0.3 0.8 (30,40] 0.4 1
(130,49) (78,170) 0.4 0.7 (40, ∞ ] 0 1000
(49,67) (110,111) 0.2 0.4
(78,170) (140,59) 0.1 0.6
Then we will present the simulation results for our
(109,33) (186,97) 0.2 0.5 algorithm and compare it to the condition (Min delay) which
just considers how to decrease the delay of each session.
At each node, we assume the bandwidth is set 40.
According to this, the maximum transmission range on each
node is decided. So we regulate maximum transmission range
on each node is equal to 40. Correspondingly, the maximum
transmission power is

( )
p = Rtmax psW
n
（12）

1116

Fig 2. The delay of 8 sessions
The figure 2 indicates the delay of 8 sessions. We find that
the delay of our algorithm is not less than the delay of the
method which always tries to minimize the delay. At session 1
the delay of our algorithm equal 1.2 and the delay of Min delay
also equal 1.2. Because there is no any successful path for
session 8, the delay of session is the infinite. But we should
know that the term s is very useful. This term also takes into
account two aspects of the bandwidth and the delay. And they
all are very important for the QoS requirement.
We can take into account the term s for the QoS
requirement of each session in future work. That means we can
just request a fixed value of s rather than the bandwidth and the
delay when we provide our QoS requirement for a session.
IV. CONCLUSION
The cognitive radio is an enhancement on the traditional
software radio concept wherein the radio is aware of its
environment and its capabilities, able to independently alter its
physical layer behavior, and capable of following complex
adaptation strategies. Methods of investigating jointly the
bandwidth and the delay for the QoS requirement in a
cognitive radio network are presented in this paper. Then we
propose a novel strategy to ensure the QoS requirement for
each session. The analysis reveals that we can take into
account the term s for the QoS requirement of each session in
1117
future work.
ACKNOWLEDGMENT
This work has been supported in part by the international S&T
cooperation program of China (NO.2007DFA11000).
REFERENCES
[1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice
Hall, 1993.
[2] C.C. Chen and D.S. Lee, “A joint design of distributed QoS scheduling
and power control for wireless networks,” in Proc. IEEE Infocom,
Barcelona, Catalunya, Spain, April 23–29, 2006.
[3] P. Gupta and P.R. Kumar, “The capacity of wireless networks,” IEEE
Transactions on Information Theory, vol. 46, no. 2, pp. 388–404, March
2000.
[4] K. Mehlhorn and G. Sch¨afer. Implementation of O(nmlogn) weighted
matchings in general graphs: The power of data structures. In Workshop
on Algorithm Engineering.(WAE), Lecture Notes in Computer
Science, to appear, 2000.
[5] S. Murthy and J.J. Garcia-Luna-Aceves, "An Efficient Routing Protocol
for Wireless Networks", ACM Mobile Networks and Application
Journal, Special Issue on Routing in Mobile Communication Networks,
Oct. 1996, pp. 183-97.
[6] C-K. Toh, "A novel distributed routing protocol to support Ad hoc
mobile computing" Proc. 1996 IEEE 15th Annual International Phoenix
Conference Computer and Communication, Mar. 1996, pp. 480-86.
[7] P. Kyasanur and N.H. Vaidya, “Capacity of multi-channel wireless
networks: impact of number of channels and interfaces,” in Proc. IEEE
Mobicom, pp. 43–57, Cologne, Germany, Aug. 28–Sep. 2, 2005.
[8] S. Ando, M. Ohmoto, and Y. Shimizu, “QoS technology for home
networks,” IEEE CCNC 2004, Jan. 2004
[9] P. Wang, Y. Yemini, D. Florissi, P. Florissi, and J. Zinky, “
Experimental QoS Performances of Multimedia Applications,”
INFOCOM 2000, March, 2000
[10] Federal Communications Commission. Spectrum policy task force
report. ET Docket 02-135, November 2002. Available at:
http://www.fcc.gov/sptf/
[11] MITOLA J, MAGUIRE G Q. Cognitive radio: making software radios
more personal[J]. Personal Communications, IEEE,1999,6(4):13-18.
[12] James, F.K., Keith, W.R.: Computer Networking A Top-Down
Approach Featuring the Internet, 3rd edn. Addison-Wesley, Reading
(2004)