Aug 22, 2005

QShine 2005
A Utility-based Distributed Maximum Lifetime
Routing Algorithm for Wireless Networks
Yuan Xue, Yi Cui
EECS Department
Vanderbilt University
Klara Nahrstedt
Computer Science Department
University of Illinois Urbana-Champaign
QShine 2005
Introduction
Multihop Wireless Network
Deployment flexibility
Resource constraint
Energy Efficient Routing
Minimum energy routing
User optimization
Maximum lifetime routing
System optimization
QShine 2005
Maximum Lifetime Routing
Existing Approach
Linear optimization formulation
Multi-commodity problem
Heuristic solution
Centralized approximation solution
Distributed combinatorial solution
Only verify whether a solution is feasible or not
Our Approach
Non-linear optimization formulation
Utility maximization problem
Distributed maximum lifetime routing algorithm
QShine 2005
Model: Power Consumption
Receiving power consumption per bit
p
r
j
= o J/bit
o : distance-independent constant
Sending power consumption per bit
p
t
ij
= o+|(d
ij
)
m
J/bit
| : coefficient of the transmit amplifier
m : constant exponent
i j
d
ij
: physical distance
Sender
Receiver
QShine 2005
Model: Node Lifetime
Total power consumption rate
p
i
= (t
i
-r
i
)p
r
i
+ t
i
p
t
ij
|
ij

t
i
: total output rate of node i
|
ij
: fraction of total output of node i towards j,
|
ij
= 1

Lifetime of node i
T
i
= E
i
/p
i
E
i
: energy reserve of node i

i
j
r
i
: data generation rate

j: all downstreaming neighbors of i

j: all downstreaming neighbors of i

Flow conservation
total input rate + data generation rate

= total output rate
t
i
|
ij
r
i
: total input rate
t
i
: total output rate
QShine 2005
Lifetime of the network
Lifetime of the node which first drains its energy
T = min{T
i
}
Lifetime allocation mechanism
Treat a nodes lifetime as its resource
Define utility for the lifetime of each node U
i
(T
i
)
System utility is the aggregate utility of all nodes
maximize U = U
i
(T
i
)

Max-min fairness
U
i
(T
i
) = (T
i
)
1-
/(1- ),
can be set arbitrarily large to approximate the optimum

i: all nodes
i: all nodes
QShine 2005
Optimality Condition
Marginal utility of node i
Change of system utility when an additional unit of data is inserted
at node i
Recursive formulation
cU/cr
i
= 0, if i is the data sink
cU/cr
i
= |
ij
o
ij


o
ij
= [cU/cr
j
+ p
t
ij
d(U
i
)/d(p
i
) + p
r
j
d(U
j
)/d(p
j
)]
The system reaches the optimal state when for any node i
o
ij
is equal for all its downstream links
i
j
Data sink

j: all downstreaming neighbors of i

marginal utility
= cU/cr
i
marginal utility
= cU/cr
i
marginal utility
= 0

QShine 2005
How to Achieve the Optimality
Distributed Routing Algorithm
In each iteration, node i decreases traffic on links with large
marginal utility, and increases traffic on links with small
marginal utility, until their marginal utilities are equal
: stepsize
Convergence
i
j
k
l
|
ij
|
ik
|
il
minimum marginal utility
A|
il
= -min((o
il
- o
min
)/t
i
, |
ik
)

A|
ik
= -min((o
ik
- o
min
)/t
i
, |
ik
)
A|
ij
= A|
ik
+ A|
il
|
ij
+ A|
ij
|
ik
+ A|
ik
|
il
+ A|
il
(a) (b) (c)
i
j
k
l
QShine 2005
Simulation Setup
Sensor Network
100 nodes in 100100m
2
square
A subset of nodes are data sources at rate 0.5 Kbps
Transmission range: 25m
Energy Reserve: 50 kJ
Comparison
MaxLife: Our Algorithm
MinEnergy: Shortest Path (Energy Consumption)
Algorithm


QShine 2005
Lifetime
Number of data sources
Lifetime
Observations
Superlinear lifetime dropoff as data sources increase
MaxLife consistently outperforms MinEnergy by at least 5 times
When =3, approximation ratio = 80%
When =4, approximation ratio = 95%
QShine 2005
Energy Cost
Number of data sources
Average Energy Cost (J/bit)
Observations
MaxLife is not as efficient as MinEnergy in terms of
average energy cost per bit
Sometimes the MaxLife algorithm has to route data
through longer route to save energy of critical nodes
QShine 2005
Energy Drainage Distribution
Node rank
Energy Drainage Distribution
Observations
MinEnergy
highly asymmetric distribution
Some hot spot nodes drain their energy, while other nodes consume
little or not at all
MaxLife
balanced distribution
50 out of 100 nodes
are data sources