loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-icns'05)
A totally distributed and adjustable scheduling algorithm in wireless Ad-Hoc networks
Papeete, Tahiti
October 23-October 28
ISBN: 0-7695-2450-8
M. GILG, University of Haute-Alsace, France
P. LORENZ, University of Haute-Alsace, France
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.
Citation:
M. GILG, P. LORENZ, "A totally distributed and adjustable scheduling algorithm in wireless Ad-Hoc networks," icas-icns, pp.47, Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-icns'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.