On the Throughput-Delay Trade-off in Georouting Networks

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

2011-07-30

arxiv.org/abs/1108.0072v1

Computer Science

Information Theory

This work has been submitted to IEEE INFOCOM 2012

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Throughput-Delay Trade-off in Georouting Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Throughput-Delay Trade-off in Georouting Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Throughput-Delay Trade-off in Georouting Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136205