New interface

# A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks

1 ARES - Architectures of networks of services
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
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.
Keywords :
Document type :
Reports
Domain :

Cited literature [11 references]

https://hal.inria.fr/inria-00071759
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 6:42:13 PM
Last modification on : Friday, February 4, 2022 - 3:19:44 AM
Long-term archiving on: : Monday, September 17, 2012 - 4:05:50 PM

### Identifiers

• HAL Id : inria-00071759, version 1

### Citation

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

Record views