Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks?

Abstract

Topology-transparent scheduling algorithms are oblivious to the network topology changes and can provide throughput and delay guarantees in mobile multihop networks. However, it has been argued that topology-transparent scheduling algorithms are inefficient when the network is static, compared to topology-dependent scheduling algorithms. In this paper, we propose to utilize both assigned and unassigned slots efficiently to boost the performance of topology-transparent scheduling algorithms. We conclude that, in certain cases, the performance of the proposed topology-transparent scheduling algorithm can be comparable to or better than that of some topology-dependent algorithms even when the network topology remains unchanged. Yet, the proposed algorithm also works even when the network topology is dynamic.