Achieving 2/3 Throughput Approximation with Sequential Maximal Scheduling under Primary Interference Constraints

摘要

In this paper, we present a scheduling policy, sequential maximal tree scheduling that attains | of the maximum throughput region in tree-graphs under primary interference constraints. The computation time of the policy varies as the square of the logarithm of the network size. Our results are a significant improvement over previous results which can attain only 1/2 of the maximum throughput region, even for graphs that have a simple path topology, in similar computation time.