Numerical solutions of continuum equilibria for routing in dense ad-hoc networks
Alonso Silva, Eitan Altman, Pierre Bernhard · 2008
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 str