A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2003

A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks

Isabelle Guérin
Janez Zerovnik
  • Function : Author

Abstract

We propose a distributed algorithm for allocating bandwidth in stable ad hoc networks. After having discussed the problem of bandwidth 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 like chains, rings, meshes and geometric random graphs.We compare our solutions with the optimal solution in terms of global bandwidth 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 tested solutions.
Fichier principal
Vignette du fichier
RR-4827.pdf (569.74 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071759 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071759 , version 1

Cite

Claude Chaudet, Isabelle Guérin, Janez Zerovnik. A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks. RR-4827, INRIA. 2003. ⟨inria-00071759⟩
40 View
303 Download

Share

Gmail Facebook X LinkedIn More