The Mathematics of Routing in Massively Dense Ad-Hoc Networks

Abstract : Computing optimal routes in massively dense adhoc networks be-comes intractable as the number of nodes becomes very large. One recent ap-proach to solve this problem is to use a fluid type approximation in which the whole network is replaced by a continuum plain. Various paradigms from physics have been used recently in order to solve the continuum model. We propose in this paper an alternative modeling and solution approach similar to a model by Beckmann [3] developed more than fifty years ago from the area of road traffic.
Type de document :
Communication dans un congrès
International Conference on Ad-Hoc Networks and Wireless (AdHoc-NOW), Sep 2008, Sophia Antipolis, France. 〈10.1007/978-3-540-85209-4_10〉
Liste complète des métadonnées

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

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

Fichier

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

Identifiants

Collections

Citation

Eitan Altman, Pierre Bernhard, Alonso Silva. The Mathematics of Routing in Massively Dense Ad-Hoc Networks. International Conference on Ad-Hoc Networks and Wireless (AdHoc-NOW), Sep 2008, Sophia Antipolis, France. 〈10.1007/978-3-540-85209-4_10〉. 〈hal-01076461〉

Partager

Métriques

Consultations de la notice

89

Téléchargements de fichiers

80