Numerical solutions of continuum equilibria for routing in dense ad-hoc networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

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

Dates and versions

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

Identifiers

Cite

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. ⟨10.4108/ICST.VALUETOOLS2008.4521⟩. ⟨hal-01076463⟩

Collections

INRIA INRIA2
78 View
86 Download

Altmetric

Share

Gmail Facebook X LinkedIn More