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. 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.
Chapter PDF
Similar content being viewed by others
Keywords
- 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.
References
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)
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)
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)
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)
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)
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)
Feldman, A.M.: Welfare Economics and Social Choice Theory. Kluwer, Boston (1980)
Chaudet, C., Guérin Lassous, I., Zerovnik, J.: A distributed algorithm for bandwidth allocation in stable ad hoc networks. Technical Report 4827, INRIA (2003)
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)
Bonald, T., Massoulié, L.: Impact of Fairness on Internet Performance. In: Proceedings of SIGMETRICS, Cambridge, MA, USA (2001)
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudet, C., Lassous, I.G., Žerovnik, J. (2004). A Distributed Algorithm for Bandwidth Allocation in Stable Ad Hoc Networks. In: Battiti, R., Conti, M., Cigno, R.L. (eds) Wireless On-Demand Network Systems. WONS 2004. Lecture Notes in Computer Science, vol 2928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24614-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24614-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20790-0
Online ISBN: 978-3-540-24614-5
eBook Packages: Springer Book Archive