The Mathematics of Routing in Massively Dense Ad-Hoc Networks

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