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

Simple item page
dc.creatorYing, Lei
dc.creatorSrikant, R.
dc.date2007-05-02
dc.date.accessioned2026-07-07T08:16:02Z
dc.date.available2026-07-07T08:16:02Z
dc.descriptionOptimal 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/0705.0326
dc.identifierhttp://arxiv.org/abs/0705.0326
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133645
dc.subjectNetworking and Internet Architecture
dc.subjectInformation Theory
dc.titleOptimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models
dc.typetext

Files

Collections

arXiv