Download now Free registration required
In the distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. This can be done by with scheduling and without scheduling. The authors calculate the delay, Travel time and they trace the path of the packets sent from source to destination nodes. In addition, simulation results indicate that the delay performance of these algorithms can be quite good in with Scheduling. In this paper, they apply an Adaptive Carrier Sense Multiple Access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively.
- Format: PDF
- Size: 651.66 KB