Throughput of ideally routed wireless ad hoc networks

In our present work we model the maximum throughput of stationary ad hoc networks. The routing process we apply is ideal in the sense that it includes collision avoidance and transmits using shortest paths between random source-destination pairs. Our model not only confirms the n-1/2 decay of the throughput that was published earlier in the literature, but also provides an approach to acquire the function relations between various network parameters. This way the effects of changes in surface topology occupied by the network, traffic generation algorithm or other network characteristics can be predicted using first order approximation