A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks

  • Claude Chaudet
  • Isabelle Guérin Lassous
  • Janez Žerovnik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2928)


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. Results obtained on geometric random graphs are presented here. 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.


Convergence Speed Medium Access Control Protocol Communication Range Bandwidth Allocation Minimum Bandwidth 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    IEEE Standard for Information Technology Telecommunications and Information Exchange between Systems: Local and Metropolitan Area Network – Specific Requirements – Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications (1997)Google Scholar
  2. 2.
    Lee, S.B., Ahn, G.S., Zhang, X., Campbell, A.T.: Insignia: An ip-based quality of service framework for mobile ad hoc networks. Journal on Parallel and Distributed Computing 60 (2000)Google Scholar
  3. 3.
    Ahn, G.S., Campbell, A.T., Veres, A., Sun, L.H.: SWAN: Service differentiation in stateless wireless ad hoc networks. In: IEEE INFOCOM 2002, New York, USA (2002)Google Scholar
  4. 4.
    Lee, S.B., Campbell, A.T.: HMP: Hotspot mitigation Protocol for Mobile Ad Hoc Networks. In: 11th IEEE/IFIP International Workshop on Quality of Service, Monterey, Canada (2003)Google Scholar
  5. 5.
    Plotkin, S.A., Schmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics Of Operations Research 20, 257–301 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bartal, Y., Byers, J.W., Raz, D.: Global optimization using local information with applications to flow control. In: 38th IEEE Symp. on Foundations of Computer Science, pp. 303–312 (1997)Google Scholar
  7. 7.
    Feldman, A.M.: Welfare Economics and Social Choice Theory. Kluwer, Boston (1980)Google Scholar
  8. 8.
    Chaudet, C., Guérin Lassous, I., Zerovnik, J.: A distributed algorithm for bandwidth allocation in stable ad hoc networks. Technical Report 4827, INRIA (2003)Google Scholar
  9. 9.
    Gertz, M., Wright, S.: Object-oriented software for quadratic programming. Technical Report ANL/MCS-P891-1000, Argonne National Laboratory, Mathematics and Computer Science Division (2001)Google Scholar
  10. 10.
    Bonald, T., Massoulié, L.: Impact of Fairness on Internet Performance. In: Proceedings of SIGMETRICS, Cambridge, MA, USA (2001)Google Scholar
  11. 11.
    Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Claude Chaudet
    • 1
  • Isabelle Guérin Lassous
    • 1
  • Janez Žerovnik
    • 2
    • 3
  1. 1.Laboratoire Citi, Insa de LyonInria Ares TeamVilleurbanne CedexFrance
  2. 2.University of MariborMariborSlovenia
  3. 3.Department of Theoretical Computer ScienceInstitute of Mathematics, Physics and MechanicsLjubljanaSlovenia

Personalised recommendations