Skip to Main Content
This paper studies optimal power control for throughput maximization in wireless ad hoc networks. Optimal power control problem in ad hoc networks is known to be non-convex due to the co-channel interference between links. As a result, a global optimal solution is difficult to obtain. Previous work either simplified the problem by assuming that the signal- to-interference-and-noise-radio (SINR) of each and every link is much higher than 1, or settled for suboptimal solutions. In contrast, we propose a novel methodology to compute the global optimal power allocation in a general SINR regime. In particular, we formulate the problem into an equivalent linear multiplicative fractional programming (LMFP). A global optimization algorithm, referred to as LMFP-based power allocation (LBPA) algorithm, is proposed to solve the LMFP with reasonable computational complexity. Our analysis proves that the LBPA algorithm is guaranteed to converge to a global optimal solution. Through extensive simulations, we show that the proposed algorithm significantly improves the throughput of wireless networks compared with existing ones.