Professional Documents
Culture Documents
I. I NTRODUCTION
c 2010 IEEE
1536-1276/10$25.00
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
FAN and JIANG: OPTIMAL MULTI-CHANNEL COOPERATIVE SENSING IN COGNITIVE RADIO NETWORKS
: () = () + (), = 1, 2, ...,
(1)
()2 .
(2)
() =
=1
1129
()
all
.
() = =1
(3)
=1
)
(
= Pr all () > 1
,
=1
(
)
2 (4)
= 2 1
/( + 1)
=1
and
=1
)
(
= Pr all () > 0
(
)
(5)
= 2 1
=1
( 2)
exp
.
2
(6)
, =
=1
(
)
. (7)
( + 1)1 +
=1
( + 1)
0, = 1, 2, ..., .
=1
(8)
From (4) and (5) it can beseen that only the total time
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
1130
Slot
Sensing phase
Slot
Sensing phase
Transmission phase
User 1
1 1 2 2 2 3 3 3
User 1
User 2
2 2 2 2 3 3 3 1
User 2
User 3
1 1 1 2 2 3 3 3
User 3
Fig. 1.
users.
)
,
ondary user is given by 1 = log(1 +
2
2
+
where is the transmission power of the primary user
in channel , and
is the channel coefficient from the
primary user to the secondary receiver in channel .
It can be seen that 0 > 1 .
In the sensing phase, a secondary user needs to sequentially
sense a number of channels, using one of the two modes:
slotted-time sensing mode and continuous-time sensing mode.
Slotted-time sensing mode: The sensing phase in each
slot is further divided into a number, , of mini-slots,
each with duration . Here the value of is a parameter to
be optimized. Each mini-slot can be used by a secondary
user to sense any channel. Fig. 1 shows an example for
= 3 channels, = 3 secondary users, and = 8
mini-slots in a sensing phase. The number inside each
mini-slot means the channel to be sensed. Note that in the
example, user 2 first senses channel 2, then channel 3, and
Transmission phase
= .
(9)
=1
(
) )
(10)
+ Pr(1 ) 1 ( , ) 1
where
( , )
and
(
(
( , ) =
((
( + 1)2
)
)
(11)
(12)
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
FAN and JIANG: OPTIMAL MULTI-CHANNEL COOPERATIVE SENSING IN COGNITIVE RADIO NETWORKS
,{ },{ }
(
)
(
=1 Pr(0 ) 1 ( , ) 0
(
) )
+ Pr(1 ) 1 ( , ) 1
s.t.
( , ) , = 1, 2, ...,
2 2 (1 + ), = 1, 2, ...,
=
=1
> 0, , = 1, 2, ...,
0 < , .
2
2
( 2
))
( , ) 0 2 ( , ) 1
0
Pr( )
.
2
2
Therefore, if
Pr(0 )
then we have
and
2 ( , )
=
2
and
1 Note
s.t.
2 ( , )
>0
2
(15)
2 ( , )
< 0.
2
(16)
(17)
(18)
()
0<
(19)
)2
2 (, { }, { })
>0
2
max () =
{ },{ }
( 2 1) (+1)
)
1 (
1
4 2 2
(
)
)2 1
1
()3/2 (
+
1
.
( + 1)2 3 ( + 1)3 2
(14)
<
2 ( , ) 1
2
2
( , ) 1
( , ) 0
2
2
) (( 2 1) )2
2 ( , )
1 (
2
2
4 2 2
(
)
)2 1
(
3/2
+ ()
1
(13)
3
2
1131
s.t.
Pr(0 ) 1 ( , ) 0
=1
(
) )
+ Pr(1 ) 1 ( , ) 1
( , ) , = 1, 2, ...,
2 2 (1 + ), = 1, 2, ...,
=1
> 0, , = 1, 2, ...,
.
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
1132
Proof: Denote
( , ) =
(
)
1 ( , ) 0
(
)
+ Pr(1 ) 1 ( , ) 1 (20)
Pr(0 )
=1
( , ).
( From equations
) (11)( and (12), it can
) be seen that both
1 ( , ) and 1 ( , ) in ( , ) grow
increase
(with the
) of . On the other hand, the term
1 ( , ) should be bounded by 1 ( . Therefore,
)
( , ) achieves its maximal value when 1 ( , )
reaches its upper bound (1 ), which happens when
( , ) = .
This completes the proof.
Define
({ }) =
Pr(0 )
(
)
1 ( , = ) 0 (21)
=1
( , )
where
is from (7), i.e.,
(
)
(
)
, = ( + 1)1 ( ) + . (22)
with in the
Based on Lemma 2, we substitute
objective function ({ }, { }) in problem P2, and we have
({ }, { }) ( , )=
= ({ }) +
in which
( , = )
)
(
= ( + 1)1 ( ) + ( + ) . (26)
Note that to make the constraints
in problem P3 feasible,
=1
should satisfy
.
=
, 0 ( =
within the region
=1
({ })
= Pr(0 )0
( +1)1 ( )+
Pr(0 )0 (( +1)
=
2 2
> 0.
Pr(1 )(1 )1
=1
and is equivalent to
(
)2
( + 1)1 ( )
, = 1, 2, ..., . (24)
(
)2
( +1)1 ( )
Then by defining =
(where is
=1
s.t.
=1
( ,
=1
2
( + ) )
( + )
) and = (1 , 2 , ...,
) such
Define = (1 , 2 , ...,
that
0, 0, 1 ;
(29)
=
=
.
=1
=1
0, 1 ;
So in the region
1, ..., ), we have
({ })
=1
from (28)
)
= ) 0
=1
=1
=1
(25)
=1
0, + 1 , = 1, 2, ...,
=1
( + )
(27)
So ({ }) is an increasing function with respect to .
(
)
We define ( ) = Pr(0 ) 1 ( , = ) 0 .
Therefore, ({ }) =
( ). The second order deriva-
1 (
)+
2
=1
{ }
=1
1, 2, ..., ).
Proof: The first order derivative of ({ }) over is
(30)
=1
=1
, 0 ( =
( )
( + (1 ) )
( ) +
(1 ) ( )
=1
({ }) + (1 )({ })
(31)
=
, 0 ( = 1, ..., ).
region
=1
=1
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
FAN and JIANG: OPTIMAL MULTI-CHANNEL COOPERATIVE SENSING IN COGNITIVE RADIO NETWORKS
2 ( )
2
Pr(0 )0
4 2
+
<
2
(( +1)1 ( )+ ( + ) )
2
(
(( +1)1 ( )+
2
( + ) )
2
( + )
From Lemma 3, problem P3 becomes a convex mixedinteger problem. Generally a mixed-integer problem is NPhard [14]. However, for problem P3, thanks to the separability
and concavity of the objective function and the linear constraints with variable coefficients all being 1s, an incremental
algorithm [15, page 384] can (be used to solve) problem P3
with polynomial complexity log + , which can
converge to the global optimal point as proved in reference
[16, pages 53-54].
The procedure of the incremental algorithm for problem P3,
referred to as Algorithm 1, is as follows.
Algorithm 1 Incremental Algorithm for Problem P3.
1: If
< 0, problem P3 is infeasible for the
=1
2: If
<
, find = arg max ( +
1
=1
=1
)
1) ( ) , and proceed to Step 3; Otherwise, proceed
to Step 4.
3: = + 1, proceed to Step 2.
4: Output { , = 1, 2, ..., }.
Since problems P2 and P3 are equivalent, the optimal
objective value of problem P2 (with a specific value),
i.e., (), can be obtained by setting = + and
( , ) = , = 1, 2, ..., .
Lemma 4: () has two properties: (1) () is an in
creasing function;
(2) () (1) (+1) ()
=1
for
, .
(32)
=1
s.t.
, .
)
(
( + 1)1 ( ) + ( + )
(28)
0.
+ )
1133
=1 < < , .
Proof:
( + 1)
( + 1) 1
()
1
[(
(
]
)
)
( 1)
1
() 1
( 1)
(
)
)
(
1
[ ( + 1) ()
)
)
(
(
( 1) ( + 1) .
() ( 1) ] +
(33)
Pr(0 ) 1 ( , ) 0
=1
(
) ))
+ Pr(1 ) 1 ( , ) 1
s.t.
( , ) , = 1, 2, ...,
2 2 (1 + ), = 1, 2, ...,
=
=1
0<
> 0, = 1, 2, ...,
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
1134
(34)
s.t. 0 < .
where ( ) is the optimal objective value of the following
problem with a specific value:
Problem P5 (with a specific value)
max
({ }, { }) =
{ },{ }
(
(
)
Pr(0 ) 1 ( , ) 0
=1
(
) )
+ Pr(1 ) 1 ( , ) 1
s.t.
( , ) , = 1, 2, ...,
2 2 (1 + ), = 1, 2, ...,
=
=1
> 0, = 1, 2, ..., .
Similar to the proof of Lemma 2, it can be proved that
function ({ }, { }) achieves the maximal value when
( , ) = .
Define
({ }) =
(
)
Pr(0 ) 1 ( , = ) 0 (35)
=1
Pr(1 )(1 )1
=1
(
)2
1
( )
. Then problem P5 is
Denote = ( +1)
Pr(0 ) 1 ( , = ) 0
=1
s.t.
=1
(
)
( ) = Pr(0 ) 1 ( , = ) 0 ,
.
(39)
It is easy to prove that function ( ) is an increasing
function.
=1
= (
) = ( ) +
>
.
( )
=1
( )
(
)
<
=1
( ) + (
).
(40)
On the other hand,
is also a feasible
solution for problem P6 with = . Recall that ( ) is
the optimal objective value of problem P6 when = . So
we have
( )
( ) + (
).
(41)
{1 , ...,
1 , }
({ }, { }) ( , )=
tion for .
Proof: We first prove it is an increasing function.
Define a function
(36)
( , )
= ({ }) +
=1
)>
Since ( ) is an increasing function, we have (
( , )
, = ( + 1)1 ( ) + .
where
, = 1, 2, ..., .
=1
(
) )
Pr(0 ) 1 ( , = ) 0 (42)
=1
and
() = max ()
()
where () = {(1 , 2 , ..., )
=1
(43)
= , , =
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
FAN and JIANG: OPTIMAL MULTI-CHANNEL COOPERATIVE SENSING IN COGNITIVE RADIO NETWORKS
max
()
(1 +(1)2 )
(1 + (1 )2 )
> (1 ) + (1 ) (2 )
(1 ) + (1 ) (2 ) .
(44)
This inequality holds for any small > 0. So we have
(1 + (1 )2 ) > (1 ) + (1 ) (2 )
7.5
C(k)
7
6.5
6
(45)
5.5
4.5
Fig. 3.
2
V. P ERFORMANCE E VALUATION
In this section, numerical results are presented to verify the
effectiveness of our proposed algorithms. Similar to [12], the
system setup is as follows. The sampling rate is = 6 MHz;
the slot duration is = 100 ms; the threshold of detection
probability is = 0.9; and between secondary users
are all assumed to have a mean 20 dB. Both (the SNR
from the primary user to a secondary user on channel ) and
are assumed to be exponentially distributed.
A. Verification of Our Algorithms
The slotted-time sensing mode is tested first. Consider =
2 channels, with the available probability as Pr(10 ) = 0.8
and Pr(20 ) = 0.6, and mean SNR from primary user to both
secondary users as 1 = 15 dB in channel 1 and 2 = 20
dB in channel 2. There are = 2 secondary users. The minislot duration is = 0.1 ms. To get the value of () (given
in (19)) at each , we use two methods: through exhaustive
search of the s and s, and through our Algorithm 1.
The results are demonstrated in Fig. 3. It is obvious that the
2 Note
=1
20
40
60
80
k
15
14
x 10
12
Number of Iterations
Exhaustive Search
Algorithm 1
() versus .
1135
n=20dB
10
n=15dB
n=10dB
8
6
4
2
0
Fig. 4.
10
M
12
14
16
18
20
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
1136
3.5
x 10
Number of Iterations
n=20dB
n=15dB
2.5
=10dB
n
2
1.5
1
0.5
0
Fig. 5.
10 12 14 16 18 20
N
55
N=5
N=9
N=19
50
45
40
35
30
25
20
10
12
14
16
18
20
Fig. 6.
algorithms for the continuous-time sensing mode, and slottedtime sensing mode with different mini-slot duration =0.01
ms, 0.05 ms, 0.1 ms, 0.5 ms, or 1 ms, the obtained optimal
network throughput is 17.4 in all cases.
In comparison of slotted-time sensing mode and continuoustime sensing mode, it is difficult to tell which one is better.
Generally, it is easier to implement the slotted-time sensing
mode in a real system. On the other hand, the complexity
in solving the problem with continuous-time sensing mode is
lower than that with the slotted-time sensing mode.
Since both sensing modes can reach almost the same
optimal network throughput, in the following, we evaluate the
performance of slotted-time sensing mode only.
D. Impact of the Number of Channels and the Number of
Users
In the system setup, there are =5, 9, or 19 channels.
Channel (1 ) has a free probability Pr(0 ) =
10.05, and the average channel gain from the primary user
to a secondary user is = (20+1) dB. Fig. 6 shows the
optimal network throughput (obtained from our algorithm) as a
function of the number, , of secondary users, with different
values. It can be seen that when the number of channels or
the number of secondary users increases, the optimal network
by
times, referred to as
=1
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
=1
FAN and JIANG: OPTIMAL MULTI-CHANNEL COOPERATIVE SENSING IN COGNITIVE RADIO NETWORKS
( 1)
1: If
< 0, problem P3 is infeasible for the given
=1
(0)
2: while <
do
3:
4:
5:
= 0, = 1, 2, ...,
=1
Set + 1
for = 1, 2, ..., do[ (
(
)]
)
(1)
(1)
,
If = arg max
+ 1
()
1
(1)
()
(1)
then
+ 1; otherwise,
=
( )
=1
6: Output
, = 1, 2, ..., .
=1
> 0.
()
> 0
=
({ }, { }) ( , )=
(
)
(
)
=1
=1
( , ) is given in (26).
Recall that Algorithm 1 leads to an optimal solution of
problem P2. So the optimal objective value of problem P2
(with a specific ), i.e., (), is given by
(
)
() =
.
(48)
=1
() ( 1)
(
)(
(
))
()
0
0
Pr ()
1 ()
() , ()
)(
(
))
(
(1)
0
0
1 ()
() , ()
Pr ()
(
)
(
)
()
()
() () () () 1 .
(49)
> 1.
=1
(47)
(
)
, respectively. Here
noted (1), (2), ...,
1137
that
(
(
)
)
(1)
(1)
() () + 1 () ()
(
(
)
)
(1)
(1)
(+1) (+1) + 1 (+1) (+1) . (51)
()
(1)
Since () = () + 1, we have
(
(
)
)
(1)
(1)
() () + 1 () ()
)
(
)
(
()
()
= () () () () 1 . (52)
(+1)
()
(1)
>1
> 1. (54)
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.
1138
Then, we have
()( ( 1) )
(
)
( 1)
=
=
=1
=1
=(1)
from (54)
=1
=1
+1
(
)
() ( 1)
(+1)=1 (
=
=1
+1
)
() ( 1)
= ( + 1) ().
(55)
Authorized licensed use limited to: UNIVERSITY OF ALBERTA. Downloaded on March 11,2010 at 20:42:50 EST from IEEE Xplore. Restrictions apply.