On the Throughput-Delay Tradeoff in Georouting Networks

摘要

We study the scaling properties of a georouting scheme in a wireless multi-hop network of mobile nodes. Our aim is to increase the network capacity quasi-linearly with , while keeping the average delay bounded. In our model, we consider mobile nodes moving according to an independent identically distributed random walk with velocity and transmitting packets to randomly chosen fixed and known destinations. The average packet delivery delay of our scheme is of order , and it achieves network capacity of order . This shows a practical throughput-delay tradeoff, in particular when compared with the seminal result of Gupta and Kumar, which shows network capacity of order and negligible delay and the groundbreaking result of Grossglauser and Tse, which achieves network capacity of order but with an average delay of order . The foundation of our improved capacity and delay tradeoff relies on the fact that we use a mobility model that contains straight-line segments, a model that we consider more realistic than classic Brownian motions. We confirm the generality of our analytical results using simulations under various interference models.