The Mathematics of Routing in Massively Dense Ad-Hoc Networks
- 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
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  developed more than fifty years ago from the area of road traffic.
Unable to display preview. Download preview PDF.