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 : 2007

Continuum Equilibria for Routing in Dense Ad-hoc Networks


We consider massively dense ad-hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and congestion dependent costs. We study both the global optimal solution as well as the non-cooperative routing problem among a large population of users. Each user seeks a path from its source to its destination so as to minimize its individual cost. We seek for a (continuum version of the) Wardrop equilibrium. We first show how to derive meaningful cost models as a function of the scaling properties of the capacity of the network as a function of the density of nodes. We present various solution methodologies for the problem: (1) the viscosity solution of the Hamilton-Jacobi-Bellman equation, (2) a transformation into an equivalent global optimization problem that is obtained by identifying some potential related to the costs. We finally study the problem in which the routing decisions are taken by a finite number of competing service providers.
Fichier principal
Vignette du fichier
a10.pdf (174.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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




  • HAL Id : hal-01076439 , version 1


Eitan Altman, Alonso Silva, Pierre Bernhard, Merouane Debbah. Continuum Equilibria for Routing in Dense Ad-hoc Networks. Annual Allerton Conference on Communication, Control, and Computing, Sep 2007, Urbana-champaign, United States. ⟨hal-01076439⟩
158 View
79 Download


Gmail Facebook X LinkedIn More