Link scheduling to maximize end- to-end throughput with fairness discipline in TDMA networks

For wireless ad hoc networks using a time division multiple access (TDMA) protocol, we present an algorithm to maximize guaranteed network end-to-end throughput subject to a fairness discipline that allocates equal end-to-end throughput to each demand. The problem of assigning bandwidths to multiple flows on each directed link of the network is formulated as a linear programming (LP) problem. The algorithm employs collections of directed links, each maximal with respect to spatial re-use. For an example network, the LP solution is compared with the results of a suboptimal yet more scalable flow allocation scheme.