Switching White Papers
A Distributed Algorithm With Linear Convergence for Maximum Lifetime Routing in Wireless Networks
Overview A wireless sensor network of nodes with limited energy is considered. The problem of computing a routing flow that maximizes the network lifetime is formulated as a linear program. This paper considers a convex optimization problem with a separable objective function that computes an approximate solution to this linear program. Approximation bounds are given for the solution to this approximate problem. A distributed algorithm with a linear convergence is proposed to solve the approximate optimization problem. The approximation can be chosen such that the lifetime given by the approximate problem is arbitrarily close to the optimal lifetime given by the linear program.
| Publisher | Stanford University | File Format | |
|---|---|---|---|
| Date Published | August 2007 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
