Optimal Delay-Throughput Tradeoffs in Mobile Ad Hoc Networks
In this paper, the authors investigate the delay - throughput tradeoffs in mobile ad-hoc networks. They consider four node mobility models: two-dimensional independent and identically distributed (i.i.d.) mobility, two-dimensional hybrid random walk, one-dimensional i.i.d. mobility, and one-dimensional hybrid random walk. Two mobility time scales are included in this paper. Fast mobility, where node mobility is at the same time scale as data transmissions. Slow mobility, where node mobility is assumed to occur at a much slower time scale than data transmissions. Given a delay constraint D, they first characterize the maximum throughput per Source-Destination (S-D) pair for each of the four mobility models with fast or slow mobiles.