Computer Science – Networking and Internet Architecture
Scientific paper
2006-11-29
Computer Science
Networking and Internet Architecture
Minor changes
Scientific paper
In this paper, we investigate the delay-throughput trade-offs in mobile ad-hoc networks under two-dimensional i.i.d. mobility models. We consider two mobility time-scales: (i) Fast mobility where node mobility is at the same time-scale as data transmissions; (ii) Slow mobility where node mobility is assumed to occur at a much slower time-scale than data transmissions. Given a delay constraint $D,$ the main results are as follows: (1) For the two-dimensional i.i.d. mobility model with fast mobiles, the maximum throughput per source-destination (S-D) pair is shown to be $O(\sqrt{D/n}),$ where $n$ is the number of mobiles. (2) For the two-dimensional i.i.d. mobility model with slow mobiles, the maximum throughput per S-D pair is shown to be $O(\sqrt[3]{D/n}).$ (3) For each case, we propose a joint coding-scheduling algorithm to achieve the optimal delay-throughput trade-offs.
Srikant R.
Yang Sichao
Ying Lei
No associations
LandOfFree
Coding Improves the Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Coding Improves the Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding Improves the Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Models will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-372578