In this paper, we address the following two questions: (i) given a set of nodes with arbitrary locations, and a set of data flows, what is the max-min achievable throughput? and (ii) how should the network be configured to achieve the optimum? We consider these questions from a networking standpoint, and pose them as an optimization problem to determine jointly optimal flow routes, link activation schedules and physical layer parameters. We obtain some interesting insights into the interplay of the achievable throughput, routing and transmit power and modulation schemes. Determining the achievable throughput is computationally hard in general, however, using a smart technique we obtain numerical results for different scenarios of interest. We believe that our optimization based framework can also be used as a tool, for planning and capacity provisioning of wireless networks.
展开▼
