Numerical solutions of continuum equilibria for routing in dense ad-hoc networks

Abstract : We study the routing problem in massively dense static ad-hoc networks as the node density increases. We use a fluid approximation in which the graph providing the available routes becomes so dense that it can be approximated by a continuous area which inherits from the original problem the cost structure: a cost density is defined at each point on the limit plain; it is a function of the location and the congestion at that point. We solve numerically the routing problem for the case where the cost density is linear with respect to congestion and we obtain a result of convergence via Finite Elements Method.
Type de document :
Communication dans un congrès
International Conference on Performance Evaluation Methodologies and Tools (ValueTools), Oct 2008, Athens, Greece. 2008, 〈10.4108/ICST.VALUETOOLS2008.4521〉
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01076463
Contributeur : Alonso Silva <>
Soumis le : mercredi 22 octobre 2014 - 11:36:22
Dernière modification le : samedi 27 janvier 2018 - 01:31:41
Document(s) archivé(s) le : vendredi 23 janvier 2015 - 10:35:55

Fichier

numerical.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Alonso Silva, Eitan Altman, Pierre Bernhard. Numerical solutions of continuum equilibria for routing in dense ad-hoc networks. International Conference on Performance Evaluation Methodologies and Tools (ValueTools), Oct 2008, Athens, Greece. 2008, 〈10.4108/ICST.VALUETOOLS2008.4521〉. 〈hal-01076463〉

Partager

Métriques

Consultations de la notice

108

Téléchargements de fichiers

62