Optimal Capacity Allocation, Routing, and Congestion Control in Wireless Networks

Abstract

We present a unified analytical framework within which capacity allocation, routing, and congestion control for wireless networks can be optimized in a coherent and integrated manner. We consider a multi-commodity flow model and examine wireless networks with general coding/modulation schemes represented by convex physical-layer capacity regions. Within this framework, capacity variables and routing variables are chosen to minimize convex link costs reflecting, for instance, average queueing delay. For problems with jointly convex cost functions, the necessary and sufficient conditions for optimality are derived. These results are then extended to the more general case where link costs are quasi-convex. Finally, we demonstrate that congestion control can be seamlessly incorporated into our framework