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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Altman, E., Bernhard, P., & Silva, A. (2008). The mathematics of routing in massively dense ad-hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5198 LNCS, pp. 122–134). https://doi.org/10.1007/978-3-540-85209-4_10
Mendeley helps you to discover research relevant for your work.