Utility-cost optimization for joint routing and power control in multi-hop wireless networks

In this paper we formulate a novel utility-cost optimization problem for routing and power control in multi-hop wireless networks. As the problem is non-convex and non-separable (no assumption on high or low SINR regime), we 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. The seamless interaction between the successive convex approximation and the primal-dual algorithm constitutes the proposed successive primal-dual convex approximation (SPDCA) algorithm.