An Efficient Guard-band-aware Spectrum Sharing

for Dynamic Access Networks

Haythem Bany Salameh
Dept. of Telecommunication Engineering
Yarmouk University, Jordan

In collaboration with Marwan Krunz (University of
Arizona) and David Manzi (Raytheon)

Funded by NSF, Raytheon, and C1
Globecom 2011
1
Outline
Overview

Motivation

Resource Allocation Problem

Proposed Solution

Performance Evaluation

Conclusions

Cognitive Radio Technology
Licensed spectrum is vastly underutilized








Need opportunistic & dynamic spectrum access (DSA) policies
Cognitive Radio (CR) is key enabling tech. for opportunistic DSA
Intelligent wireless comm. system that is aware of its RF environment &
can adapt its operating parameters accordingly


Ideal vs. Actual Transmission Filter

Spectrum sharing algorithms for CRNs are often designed
ignoring adjacent-ch. interference (assuming ideal filtering)







Guard bands between adjacent chs are needed to mitigate
adjacent ch. interference & protect ongoing txs
Guard bands adds a constraint on the effective use of the spectrum












Guardband Aware Assignment-Motivation
Observation: Guard bands are not needed between contiguous chs
assigned to the same tx (frequency block)
Each freq. block introduces 2 guard chs
For m data chs aggregated from k non-contiguous blocks, then m+2k
chs are needed

Efficient assignment should min. the no. of req. guard chs for a given
tx by assigning adjacent chs as much as possible to that tx (min. k)








No. of Freq. Blocks (k)

N
o
.

o
f

R
e
s
e
r
v
e
d

C
h
s

Channel Assignment Problem

Problem statement: For a CR tx. with given idle/busy/reserved chs,
compute the optimal ch. assignment that max spectrum efficiency
by being guardband-aware subject to:

Design constraints
Half-duplex operation
Predefined maximum transmit power on CR trans.
SINR threshold: the rate over an idle ch. = R
b
if SINR > m*
Each CR user requires demand rate of R
D
= m R
b
Guard band reservation
Guard band reuse
No guard band reuse
Near-optimal Channel Assignment

The optimal ch assignment constitutes an integer linear
programming problem (ILP), which is NP-hard

We propose a sub-optimal algorithm based on a sequential fixing
procedure (SFLP)
The main idea behind our fast solution is to sequentially determine the
binary variables through solving a series of relaxed LPs
Because the LP solver has a polynomial time complexity, our SFLP can
compute a near optimal solution in polynomial time


Performance Evaluation
Simulation setup
100mx100m field
N CR links
21 PR chs each with ON/OFF channel availability model
Busy probability are P
B
for all PRNs

Link-level Simulation
Algorithm verification

Network-level simulations compared to a greedy approach
Blocking Probability
Throughput




Link-level Simulations (N=1)
Algorithm Verification SFLP algorithm
Low activity (P
B
=0.1)
High activity (P
B
=0.7)
The solution is within 5% from the optimal










N
o
r
m
a
l
i
z
e
d

C
o
s
t

(
w
.
r
.
t
.

o
p
t
i
m
a
l
)

Link Configuration
N
o
r
m
a
l
i
z
e
d

C
o
s
t

(
w
.
r
.
t
.

o
p
t
i
m
a
l
)

Link Configuration
Spectral Efficiency
m=3
S
p
e
c
t
r
u
m

E
f
f
i
c
i
e
n
c
y

P
B
A
v
g
.

N
o
.

o
f

F
r
e
q
.

B
l
o
c
k
/
t
x

(
k
)

P
B
m=2
Network Performance
B
l
o
c
k
i
n
g

P
r
o
b
a
b
i
l
i
t
y

N
Other values of m depicted similar behavior
m=2
T
h
r
o
u
g
h
p
u
t

(
M
b
p
s
)

N
Conclusions
We proposed an opportunistic guard-band-aware ch. assignment
for CRNs that attempts at max. spectrum efficiency

We formulated our ch. assignment as an ILP problem with the
objective of min. the req. spectrum resources for a given CR tx

We presented a polynomial-time algorithm based on a sequential
fixing procedure that provides a near-optimal solution

We showed that a guard band-aware channel assignment can
significantly improve spectrum efficiency



Thank you