Throughput of ideally routed wireless ad hoc networks

Authors:
Eszter Kail;Gábor Németh;Zoltán Richárd Turányi
Affiliations:
Traffic Analysis and Network Performance Laboratory, Ericsson Hungary, 1037 Laborc utca 1, Budapest, Hungary;Traffic Analysis and Network Performance Laboratory, Ericsson Hungary, 1037 Laborc utca 1, Budapest, Hungary;Traffic Analysis and Network Performance Laboratory, Ericsson Hungary, 1037 Laborc utca 1, Budapest, Hungary
Venue:
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Year:
2001

Citing 2
Cited 3

Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
The capacity of wireless networks

IEEE Transactions on Information Theory

Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Low latency wireless ad hoc networking: power and bandwidth challenges and a solution

IEEE/ACM Transactions on Networking (TON)
Power consumption comparison for regular wireless topologies using fault-tolerant beacon vector routing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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