Date Added: Mar 2010
The authors are interested in finding a jointly optimal scheduling, routing and power control that achieves max-min fair rate allocation in a multi-hop wireless network. This is a highly complex non-convex optimization problem and it has been previously solved only for small networks. They restrict themselves to symmetric networks with ring and line topologies, and they numerically solve the problem for a large number of nodes. They model point-to-point links as single user Gaussian channels where nodes cannot send and receive at the same time. This type of channel approximates the performance of CDMA networks and performs better than the equivalent 802.11 network.