A distributed algorithm for bandwidth allocation in stable ad hoc networks

Abstract

We propose a distributed algorithm for allocating bandwidth in stable ad hoc networks. After having discussed the problem of band-width allocation in such networks, we define a sequence of feasible solutions to this problem. This sequence has the property to be an increasing sequence in terms of overall used bandwidth. After a theoretical analysis of the sequence, we design a distributed algorithm based on this sequence. We test our algorithm by simulations on different topologies. Results obtained on geometric random graphs are presented here. We compare our solutions with the optimal solution in terms of global band-width allocation that presents the smallest standard deviation and with the the fairest solution regarding to max-min fairness. The simulations show that the global used bandwidth is less than 25% from optimality in the worst case and the standard deviation is the smallest of the three. © IFIP International Federation for Information Processing 2004.