The Mathematics of Routing in Massively Dense Ad-Hoc Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

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.
Fichier principal
Vignette du fichier
adhocnow.pdf (190.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01076461 , version 1 (22-10-2014)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
68 View
148 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More