Throughput Versus Routing Overhead in Large Ad Hoc Networks

Radha Krishna  Ganti; Martin Haenggi

4th International ICST Conference on Wireless Internet

Research Article

Throughput Versus Routing Overhead in Large Ad Hoc Networks

Download466 downloads

Cite: BibTeX Plain Text

@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

Radha Krishna Ganti¹^,*, Martin Haenggi¹^,*

1: Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA

*Contact email: rganti@nd.edu, mhaenggi@nd.edu

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.

Keywords: Wireless networks ad hoc networks routing overhead transport capacity.

Published: 2010-05-16
Publisher: ICST
Modified: 2010-05-16

: http://dx.doi.org/10.4108/ICST.WICON2008.4960