Radio Resource Allocation

R. L. Cruz, UCSD
Michele Zorzi, Univ. of Padova, Italy

MURI Kick-Off Meeting

June 15, 2004
 Outline of Talk
• Fixed wireless multi-hop networks (Cruz)
– Joint power control, scheduling, routing, beamforming
– Series of papers, joint work w/ Arvind Santhanam,
Bongyong Song, Yih-Hao Lin, Prof. Bhaskar Rao
• Routing in mobile, ad-hoc wireless networks (Zorzi)
– Geographic Random Forwarding (GeRaF)
– Joint work with Prof. Ramesh Rao
• Discuss contrast between model assumptions
– Directions for future research collaborations
Radio Resource Allocation in
Fixed Wireless Networks
R. L. Cruz
Dept. of Electrical & Computer Engineering
University of California, San Diego

Joint work with Arvind Santhanam,

Bongyong Song, Yih-Hao Lin, & Bhaskar Rao
 TARGET APPLICATION AREAS FOR
FIXED WIRELESS NETWORKS

• Wireless Infrastructure Extension

Networks
• e.g., each node above is 802.11 Access
Point
• Focus on Transport of Aggregated Traffic
Between Access Points
• Residential Broadband Internet Access
 Example of a Multihop Wireless Network
PROBLEM DEFINITION

• Given Average Data Rate

Requirement per Link

• Given Peak Transmission

Power per Node

• All Path Gains are Assumed to

be Known and Fixed

• FIND SCHEDULE OF POWER

ALLOCATIONS AND ANTENNA
WEIGHTS THAT MEET
ABOVE CONSTRAINTS AND
MINIMIZE TOTAL AVERAGE
POWER
 MIMO Multi-hop Wireless
Networks
• Network Configuration

1 link k
.
1
. . . .
. . . .
sk (t) . .
Transmit . xl (t ) .
. j . sˆl (t )
. Array j
. Receive .
. Array
sl (t ) Processing .
link l
. .
. . .
. . Processing
. .
Q
. . sˆ m( t )
. . .
.
P
.
link m

– A single node can participate in multiple links as a source

and/or a destination
– Multiple links from/to a single node can be simultaneously
active using the SDM/SDMA principle
 System Model
• Network Configuration
– A multi-hop network composed of N nodes and L directional
links
– Q tx. antennas and P rx. antennas

• Array Processing : Beamforming

– A set of Tx. array weight vectors
V = [v1, ... , v L ]
– A set of Rx. array weight vectors
U = [u1, ... , uL ]

• Power Control €
– infinitesimal granularity
€ P max
– Node i is subject to the peak power constraint i
T
– Network Power Vector P = [P1, ... , PL ]

€
 System Model (2)

• Transmission Mode : a set T = {P, V, U}

• Policy : Transmission Mode Scheduling
– Frame format Frame format

T0 T1 . . . TM ?1

?0 ?1 ?M ?1

– A policy
π ={T , Λ} where T= {T0 ,...,TM −1}, Λ = {λ o ,..,λ M −1}
M = L +1 , ∑λ i = 1
i

ۥ Average Minimum Rate Requirement : C = { C1, ... , CL }

– QoS support

€
 System Model (3)
• Channel Model : Flat fading MIMO channel
– Matrix Channel (PQ)
– LOS channel with standard ULA (Uniform Linear Array)
H ij = g ij aP (θ ijt )aTQ (θ ijr )

where ⎛ λ ⎞
2
P−1
j(n− )π cos(θ ) gij = ⎜ ⎟
⎜ 4πd ⎟
a P (θ) = [...,e 2
,...]T ⎝ ij⎠

– Received signal vector at the receiver of link

x l (t ) = Pl H ll v l sl (t ) + ∑ Pi H li v i si (t ) + n l (t )
€ i∈L ,i ≠l

–ÖSpatial
in
= P covariance
H v v H
H H
+ matrices
2
I Ö s
= Pl H ll v l v lH H llH
l ∑ i li i i li n
i ≠l
σ l l
 System Model (4)
u lH Ö ls u l Pl Gll
• SINR Γl = H in =
u l Ö l u l ∑ Pi Gli + σ n2l
i

2
where Gij =| uiH ij v j | : effective link gain
• Data Rate Model
– monotonically non-decreasing function of SINR
€
– Single Rate / Multiple Rate (link adaptation)
– Logarithmic in SINR ( 0.16 ≤ k ≤ 1 )
– Linear in SINR
Xl Xl Xl Xl

X0 X3
X2
X l = W log 2 (1 + k Γl ) X l = W ' Γl
X1

Γ0 Γ1 Γ2 Γ3
Γl Γl Γl Γl
(a) (b) (c) (d)
 Resource Allocation Example: String
Topology (Traffic Relay Network)
Destination
Source Node
Node

Ratio of Maximum
Throughput Achievable
with Optimal Scheduling
and Power Control
to that of TDMA versus
ambient noise power:
 Resource Allocation Example: String Topology
(Traffic Relay Network)
Destination
Source Node
Node

Transmission mode
Total Power Requirement {(1,2),(4,5)} is used
for Optimal Scheduling and here (concurrent
Power Control versus transmissions)
System Throughput
{(1,2),(3,4)}
is also used
(for 3rd data point in
here
previous figure)
TDMA is optimal here
Resource Allocation Example: Diamond Topology
(Optimal Routing Demo)

Destination
Source Node
Node Slightly asymmetric:
1--> 2 --> 4 is Minimum
Energy Route

Ratio of Maximum
Throughput Achievable
with Optimal Routing, Scheduling
and Power Control using Multiple
Routes to that when only the
Minimum Energy Route is Used,
versus Ambient Noise Power
 Resource Allocation Example: Diamond Topology (Optimal
Routing Demo)

Destination
Source Node
Node Slightly asymmetric:
1--> 2 --> 4 is Minimum
Energy Route

Total Power Requirement Alternate (less efficient)

for Optimal Routing, Route 1 --> 3 --> 4
Scheduling and Power is used: {(1,2),(3,4)}
Control versus and {(1,3),(2,4)}
System Throughput (Concurrent
Transmissions)
(for 3rd data point in
previous plot)
TDMA along Minimum
Energy Route used here
 Hierarchical Approach for Large Networks

• Partition Links into Disjoint

Clusters, e.g. 1 - 16 here:

•Scheduling in Each Cluster

is Performed Independently

• Inter-cluster Interference
is Modeled by Constant
Power Ambient Noise
(THIS IS CONSERVATIVE!)

• Inter-cluster coordination for

distant clusters is weak:
Solve Fixed Point Equation
 Hierarchical Approach for Large Networks

• EXAMPLE: 3 Cluster Schedules

are considered:

• Schedule X:
All 16 Clusters on Always

• Schedule Y:
Checkerboard Alternation
between 2 Cluster Groups
 Hierarchical Approach for Large Networks

• EXAMPLE: Three Cluster

Schedules are considered:

• Schedule X:
All 16 Clusters on Always

• Schedule Y:
Checkerboard Alternation
between 2 Cluster Groups

• Schedule Z:
Alternation between
4 Cluster Groups
 Hierarchical Approach for Large Networks
Performance Evaluation of
Cluster Schedules X,Y,Z

• Total Average Power vs.

Network Throughput (all
links have equal rates)

• No Schedule Dominates
for All Data Rates

• Can Combine Schedules

via Time Sharing
(Convex Hull)
Joint Power Control and Beam-forming

• Optimization of Single Transmission Mode

• Given target data rates (SINRs) for each active link
in transmission mode
• Joint optimization of power vector P, transmit
weight vector V, receive weight vector U
• Non-convex optimization problem, currently
developing promising heuristics based on network
duality
 Possible Future Directions
• Development of integrated heuristics (routing,
scheduling, power control, beam-forming) for
large scale fixed networks (on-going work)
• Consideration of time varying channels (fading)
• Consideration of vector channels for each link
(MIMO vs beam-forming)
• Reaction strategies for external interference
(jamming)
• Distributed protocols for channel measurement
Geographic Random Forwarding (GeRaF)
• “Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor
Networks: Multihop Performance,” by Michele Zorzi and Ramesh
R. Rao, IEEE Transactions on Mobile Computing, Oct-Dec, 2003

• “Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor

Networks: Energy and Latency Performance,” by Michele Zorzi and
Ramesh R. Rao, IEEE Transactions on Mobile Computing, Oct-Dec,
2003
GeRaF basic idea
Possible Future Directions
• Use of antenna arrays
– tradeoffs between diversity of reception
and reliability of each link
• Integration of protocols optimized for
different environments
– centralized versus distributed
– uncertainty in channel parameters
– mobile nodes versus fixed nodes
Backup Slides
 Duality Approach
Suppose network consisted of a single link:

P1 Convex hull: describes feasible

average values
Universe of possible actions in a
single slot.
Transmitter is idle
Transmitter is on
“full blast”
0 C1 C1-X1

Optimal operating point

 Duality Approach

Suppose network consisted of a single link:

Convex hull: describes feasible
P1 average values

Universe of possible actions in a

single slot.

C1-X1

Optimal operating point

 Duality Approach
Suppose network consisted of a two links:

P1+P2 Convex hull

Transmitter 1: full blast
Transmitter 2: full blast

Transmitter 1: full blast

Transmitter 2: idle
Optimal operating point (avg)
C1-X1
Transmitter 1: full blast
Transmitter 2: idle Both transmitters idle
C2-X2
 Resource Allocation Example: Access Network
1 --> 3 --> 6, 2 --> 3 --> 6
and 3 --> 6 are Minimum
Energy Routes
Source
Nodes Destination
Node

Ratio of Maximum
Throughput Achievable
with Optimal Routing, Scheduling
and Power Control using Multiple
Routes to that when only the
Minimum Energy Route is Used,
versus Ambient Noise Power