Skip to Main Content
In this paper, we investigate the delay-throughput trade-off in mobile ad-hoc networks under two-dimensional i.i.d. mobility model with fast mobiles, and show that the optimal trade-off can be achieved using rate-less codes. Given a delay constraint D, we first prove that the maximum throughput per source-destination (S-D) pair is O(radic(D/n)) , and then propose a joint coding-scheduling algorithm to achieve the maximum throughput. The result can be extended to two-dimensional i.i.d. mobility model with slow mobiles, one-dimensional mobility models, and hybrid random walk mobility models.