Computer Science – Computer Science and Game Theory
Scientific paper
2009-10-28
Computer Science
Computer Science and Game Theory
Scientific paper
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 where each user seeks a path from its origin to its destination so as to minimize its individual cost. Finally, 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 and of the density of nodes. We present various solution methodologies for the problem: (1) the viscosity solution of the Hamilton-Jacobi-Bellman equation, for the global optimization problem, (2) a method based on Green's Theorem for the least cost problem of an individual, and (3) a solution of the Wardrop equilibrium problem using a transformation into an equivalent global optimization problem.
Altman Eitan
Bernhard Pierre
Debbah Merouane
Silva Alonso
No associations
LandOfFree
Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-718506