A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks

Claude Chaudet 1 Isabelle Guérin Janez Zerovnik
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.
Document type :
Reports
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071759
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:42:13 PM
Last modification on : Saturday, October 27, 2018 - 1:20:19 AM
Long-term archiving on : Monday, September 17, 2012 - 4:05:50 PM

Identifiers

  • HAL Id : inria-00071759, version 1

Collections

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⟩

Share

Metrics

Record views

155

Files downloads

491