Throughput of ideally routed wireless ad hoc networks
Gábor Árpád Németh, Zoltán Richárd Turányi, András G. Valkó · ACM SIGMOBILE Mobile Computing and Communications Review · 2001
We investigate the throughput of ad hoc networks using ideal shortest path routing between randomly selected source-destination pairs. Our results not only confirm the n -1/2 decay of the throughput that was published earlier in the literature, but also provides an approach to acquire the relation of various network parameters. This way the effects of changes in the routing, traffic generation algorithms or other network characteristics can be predicted using a first order approximation.