Download now Free registration required
In this paper, the authors investigate the delay-throughput trade-offs in mobile ad-hoc networks. They consider four node mobility models: two-dimensional 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, the authors first characterize the maximum throughput per source-destination pair for each of the four mobility models with fast or slow mobiles. The authors then develop joint coding-scheduling algorithms to achieve the optimal delay-throughput trade-offs.
- Format: PDF
- Size: 303.6 KB