Download now Free registration required
In this paper the authors formulate a novel utility-cost optimization problem for routing and power control in multihop wireless networks. As the problem is non-convex and non-separable (no assumption on high or low SINR regime), they approach it by solving a sequence of convex approximation problems. If the initial convex approximate is feasible, it is shown that the solution sequence converges to a KKT point to the original utility-cost optimization problem. The convex approximation problems are solved recursively by means of primal-dual methods that are shown to be amenable to distributed implementation.
- Format: PDF
- Size: 256.58 KB