A class of convergent algorithms for resource allocation in wireless fading networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Signal Processing
Layering as optimization decomposition: questions and answers
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Minimum Cost Routing with a Lifetime Guarantee in Wireless Sensor Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 754.84 |
In wireless networks, important network functionalities such as power control, rate allocation, routing, and congestion control must be optimized in a coherent and integrated manner. In this work, an interference-limited wireless network is considered, whereby power control and routing variables are chosen to minimize the sum of link costs which depend on both link capacities and link flow rates. The necessary conditions for optimality are established. These conditions are sufficient for optimality if link cost functions are jointly convex, and imply Pareto optimality if link costs are strictly quasi-convex. Network algorithms based on the scaled gradient projection method, where power control and routing are performed on a node-by-node basis, are presented. For these algorithms, explicit scaling matrices and stepsizes are found which lead to more distributed implementation, and which guarantee fast convergence to a network configuration satisfying the optimality conditions, starting from any initial configuration with finite cost. Refinements of the algorithms for more accurate link capacity models are presented, and the results are extended to wireless networks where the physical-layer rate region is given by an arbitrary convex set. Finally, it is shown that the power control and routing algorithms can naturally be extended to incorporate congestion control.