PROJECT TITLE :
On the Throughput-Delay Tradeoff in Georouting Networks - 2016
We study the scaling properties of a georouting theme in a very wireless multi-hop network of n mobile nodes. Our aim is to extend the network capability quasi-linearly with n, while keeping the common delay bounded. In our model, we tend to contemplate mobile nodes moving consistent with an independent identically distributed random walk with velocity v and transmitting packets to randomly chosen fixed and known destinations. The average packet delivery delay of our scheme is of order one/v, and it achieves network capability of order (n/log n log logn). This shows a practical throughput-delay tradeoff, in particular in comparison with the seminal result of Gupta and Kumar, which shows network capacity of order (n/log n)1/a pair of and negligible delay and the groundbreaking results of Grossglauser and Tse, which achieves network capability of order n but with an average delay of order vn/v. The foundation of our improved capability and delay tradeoff relies on the fact that we use a mobility model that contains straight-line segments, a model that we tend to contemplate more realistic than classic Brownian motions. We tend to ensure the generality of our analytical results using simulations beneath varied interference models.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here