Download Now Free registration required
The authors propose a randomized distributed scheduling algorithm which can achieve the optimal throughput under the general interference model. The proposed algorithm is analyzed to show an attractive performance in that it can return a maximal schedule with high probability and has a low time-complexity. They also provide the simulation results to validate performance analysis of their algorithm. In this paper, they consider the problem of how to achieve the maximal throughput in wireless networks with distributed scheduling algorithms under the general K-hop interference constraint.
- Format: PDF
- Size: 194.04 KB