In this paper the authors address the problem of throughput maximization and delay minimization in general topology radio networks, operating under a collision free TDM policy. In the first phase they maximize the throughput by using a Linear Programming problem formulation. The authors obtain a link bandwidth allocation which accounts for the end to end traffic requirements as well as the routing algorithm. Probabilistic and deterministic routing policies are considered. In the second phase the authors address the delay minimization problem for the bandwidth allocation obtained in the first phase. Delay minimization is approached through an appropriate slot ordering, achieved using a Golden Ratio based heuristic. The resulting bandwidth allocation guarantees packet delivery in finite time and drastically improves network performance. Specifically, it is shown that the results obtained, in terms of throughput are superior to a uniform bandwidth allocation, showing improvements in the order of 125%. In terms of average packet delay, results show a reduction of approximately 30% delay when compared with random slot ordering.
