International Research Publication House (IRPH)
In multihop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional Maximal Weight Scheduling (MWS), although throughput-optimal, is difficult to implement in distributed networks. On the other hand, a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, the authors introduce an adaptive Carrier Sense Multiple Access (CSMA) scheduling algorithm that can achieve the maximal throughput distributively.