Throughput of ideally routed wireless ad hoc networks

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.

[1]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[3]  R. Rozovsky,et al.  Protocols for media access control and power control in wireless networks , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[4]  Eszter Kail,et al.  The Effect of the Transmission Range on the Capacity of Ideal Ad Hoc Networks , 2001 .

[5]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .