A decentralized control strategy for joint resource allocation and routing in node-based wireless data networks

The optimal performance of the network can be achieved by simultaneous optimization of routing and resource allocation. We use a delayed dynamic model of queue length in each node to describe the data flows in the network. Unlike similar previous works in the literature we assume that delay exists in the queuing model and so we will have dynamic flow model for the routing of data packets across the network. We assume that the capacity of a wireless link is a concave and increasing function of the communications resources allocated to the link, and the communications resources for groups of links are limited. With these assumptions we formulate the simultaneous routing and resource allocation (SRRA) problem as a convex optimization problem over the network flow variables and the communications variables. By our control strategy, an optimal routing performance in the presence of unknown network delays in network modeling and resource limitations is achieved.