Power is often a scarce resource in wireless ad hoc networks. The primary performance objectives of wireless ad hoc networks are power conservation and utility maximization. Power control is to minimize the overall transmitted power given a constant signal-to-interference-and-noise ratio (SINR) requirement for each user. To solve this problem, many pieces of work have been done in the literature, which mainly concentrate on optimizing power and rate allocation with cross layer design. In addition to these results, several distributed cross-layer optimization frameworks were proposed to jointly allocate spectral bands, power and data rate for lifetime or utility maximization in wireless ad hoc networks. These joint data rate and power allocation strategies are based on nonlinear programming and the dual subgradient Method. The optimal solutions by means of the dual method depend on the convexity of the investigated optimization problem. However, in wireless ad hoc networks, because of multi-path routing and time-varying channel states, the optimization problem may not be convex. This implies that it cannot be guaranteed to obtain the optimal power scheduling and rate allocation since there might be a duality gap between the problem and its dual. Therefore, it is needed to introduce some new variables and transform a non-convex optimization problem into a convex one (Lin and Shroff, 2006). Obviously, this leads to the increase of computational complexity. It is also difficult to choose the appropriate dual Lagrangian Multipliers (penalty factors) and iteration step sizes, and a numerical solution obtained by the dual approach requires overwhelming computational effort, which increases exponentially as the size of the problem increases.