Distributed network utility maximization in wireless networks with a bounded number of paths

Abstract

We consider the fair multicommodity flow problem in multihop wireless networks. We optimize the flow between a number of source-destination pairs to achieve a fair allocation of network resources while satisfying node capacity constraints. To account for the limitations of wireless devices, we use a path-based formulation and allow only a bounded number of paths between each source-destination pair. We develop a dual decomposition based distributed algorithm for solving the problem, show the optimality of a stationary solution, and compare the performance of the algorithm with a centralized branch-and-bound method.