# On the Throughput-Delay Trade-off in Georouting Networks

3 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : We study the scaling properties of a georouting scheme in a wireless multi-hop network of $n$ mobile nodes. Our aim is to increase the network capacity quasi linearly with $n$ while keeping the average delay bounded. In our model, mobile nodes move according to an i.i.d. random walk with velocity $v$ and transmit packets to randomly chosen destinations. The average packet delivery delay of our scheme is of order $1/v$ and it achieves the network capacity of order $\frac{n}{\log n\log\log n}$. This shows a practical throughput-delay trade-off, in particular when compared with the seminal result of Gupta and Kumar which shows network capacity of order $\sqrt{n/\log n}$ and negligible delay and the groundbreaking result of Grossglausser and Tse which achieves network capacity of order $n$ but with an average delay of order $\sqrt{n}/v$. We confirm the generality of our analytical results using simulations under various interference models.
Document type :
Conference papers

Cited literature [19 references]

https://hal.inria.fr/hal-00950686
Contributor : Alonso Silva <>
Submitted on : Friday, February 21, 2014 - 6:39:08 PM
Last modification on : Friday, March 6, 2020 - 1:37:30 AM
Document(s) archivé(s) le : Wednesday, May 21, 2014 - 12:16:48 PM

### Files

georouting.pdf
Files produced by the author(s)

### Citation

Philippe Jacquet, Salman Malik, Bernard Mans, Alonso Silva. On the Throughput-Delay Trade-off in Georouting Networks. INFOCOM 2012 - 31st IEEE INFOCOM, Mar 2012, Orlando, Florida, United States. pp.765 - 773, ⟨10.1109/INFCOM.2012.6195823⟩. ⟨hal-00950686⟩

Record views