A totally distributed and adjustable scheduling algorithm in wireless Ad-Hoc networks
Marc Gilg, Pascal Lorenz · 2005
In a half duplex mobile ad-hoc network, fair allocation of bandwidth and maximization of channel utilization are two antagonistic parameters. In this paper, we propose to use a totally distributed scheduling algorithm with one control parameter. This algorithm permits to maintain a minimum transmission rate for the nodes and to preserve the throughput of the network