An Energy-Efficient and Fast Convergent Resource Allocation Algorithm in Distributed Wireless Ad Hoc Networks

Since the initial publication of Kelly
et al
.’s seminal paper on resource allocation in wired networks, many studies based on the cross-layer design philosophy have been conducted in both wired and wireless networks. The Lagrangian duality technique has been widely adopted to solve the cross-layer optimization problem, but it is slowly convergent and sensitive to the iterative step size, especially for large networks. In this paper, a joint congestion control and power allocation second-order algorithm (JCCPA) is proposed, in which the joint optimization problem is modeled as a network utility maximization (NUM) framework, and the primal-dual interior-point method is used to solve the NUM problem. The JCCPA updates the primal variables and dual variables simultaneously according to their Newton directions; as a result,resulting in a faster convergence speed is reached. Moreover, the matrix-splitting technology is utilized to decompose the computation of the Hessian matrix and its inverse into different nodes and links so that the distributed update of source rate and node power can be implemented. The simulation results demonstrate that the JCCPA not only significantly improves energy efficiency but also has a faster convergence speed and is insensitive to step size.