Distributed throughput maximization in wireless networks via random power allocation

We consider throughput-optimal power allocation in multi-hop wireless networks. The study of this problem has been limited due to the non-convexity of the underlying optimization problems, that prohibits an efficient solution even in a centralized setting. We take a randomization approach to deal with this difficulty. To this end, we generalize the randomization framework originally proposed for input queued switches to an SINR rate-based interference model. Further, we develop distributed power allocation and comparison algorithms that satisfy these conditions, thereby achieving (nearly) 100% throughput. We illustrate the performance of our proposed power allocation solution through numerical investigation and present several extensions for the considered problem.