Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models

Details Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models

2007-05-02

arxiv.org/abs/0705.0326v1

Computer Science

Networking and Internet Architecture

13 pages

Scientific paper

Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility models have been established in [23], where we showed that the optimal trade-offs can be achieved using rate-less codes when the required delay guarantees are sufficient large. In this paper, we extend the results to other mobility models including two-dimensional hybrid random walk model, one-dimensional i.i.d. mobility model and one-dimensional hybrid random walk model. We consider both fast mobiles and slow mobiles, and establish the optimal delay-throughput trade-offs under some conditions. Joint coding-scheduling algorithms are also proposed to achieve the optimal trade-offs.

Affiliated with

Also associated with

No associations

Rating

Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional 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 Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675120