Comparison Between Graph-Based and Interference-Based STDMA Scheduling

Spatial reuse TDMA is a ¯xed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time slot when the interferences caused are not too severe. We consider two methods of generating tra±c controlled reuse schedules. One method uses full knowledge of the interfer-ence environment to generate schedules. The other method uses a graph representation of the network, assuming limited knowledge of the interferences. By simulations, we evaluate the proposed methods in terms of average delay and through-put. The simulation results indicates that the network perfor-mance of the graph-based scheduling may su®er compared to the interference-based scheduling, depending on how the graph is created. In a stationary situation, or temporary stationary situa-tion, where knowledge of the full interference environment can be assumed, interference based scheduling can improve the network capacity by up to one third, thereby being worth its increased complexity. 1