The Mathematics of Routing in Massively Dense Ad-Hoc Networks

  • Eitan Altman
  • Pierre Bernhard
  • Alonso Silva
Conference paper

DOI: 10.1007/978-3-540-85209-4_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5198)
Cite this paper as:
Altman E., Bernhard P., Silva A. (2008) The Mathematics of Routing in Massively Dense Ad-Hoc Networks. In: Coudert D., Simplot-Ryl D., Stojmenovic I. (eds) Ad-hoc, Mobile and Wireless Networks. ADHOC-NOW 2008. Lecture Notes in Computer Science, vol 5198. Springer, Berlin, Heidelberg

Abstract

Computing optimal routes in massively dense adhoc networks becomes intractable as the number of nodes becomes very large. One recent approach 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Eitan Altman
    • 1
  • Pierre Bernhard
    • 2
  • Alonso Silva
    • 1
  1. 1.INRIASophia AntipolisFrance
  2. 2.I3S, University of Nice-Sophia Antipolis and CNRSFrance

Personalised recommendations