Joint congestion control
Francesco Lo Presti · 2005
In this paper we present a model for the joint congestion control, routing and MAC link access for ad hoc wireless networks. We formulate the problem as a utility maximization problem with routing and link access constraints. For the solution we exploit the separable structure of the problem via dual decomposition and the sub-gradient algorithm. The resulting algorithm directly translates into a distributed cross-layer scheme for joint congestion control, routing and link scheduling of the wireless links which revolves around link layer pricing. The convex problem formulation and the use of the sub-gradient algorithm ensures that the solution converges within an interval of the optimal value. We illustrate the algorithm behavior through examples.