Research Article
Throughput Versus Routing Overhead in Large Ad Hoc Networks
@INPROCEEDINGS{10.4108/ICST.WICON2008.4960, author={Radha Krishna Ganti and Martin Haenggi}, title={Throughput Versus Routing Overhead in Large Ad Hoc Networks}, proceedings={4th International ICST Conference on Wireless Internet}, publisher={ICST}, proceedings_a={WICON}, year={2010}, month={5}, keywords={Wireless networks ad hoc networks routing overhead transport capacity.}, doi={10.4108/ICST.WICON2008.4960} }- Radha Krishna Ganti
Martin Haenggi
Year: 2010
Throughput Versus Routing Overhead in Large Ad Hoc Networks
WICON
ICST
DOI: 10.4108/ICST.WICON2008.4960
Abstract
Consider a wireless ad hoc network with n nodes distributed uniformly on [0, 1]2. The transport capacity (TC) of such a wireless network scales like √n. To achieve this, each node should serve about √n distinct information flows. So the routing table of each node should be of the order √n bits. We show that if the size of the routing table is restricted to be of the order O(nH(δ)), the maximum achievable pernode TC is O(nR(δ)) when the source-destination distance is n-δ/2. We show that R(δ) = min {1/2, δ/2 + H(δ)} - 1 is the optimal tradeoff.
Copyright © 2008–2024 ICST
