Coding Improves the Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Models

Simple item page
dc.creatorYing, Lei
dc.creatorYang, Sichao
dc.creatorSrikant, R.
dc.date2006-11-29
dc.date2007-05-02
dc.date.accessioned2026-07-07T08:16:51Z
dc.date.available2026-07-07T08:16:51Z
dc.descriptionIn 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.
dc.descriptionMinor changes
dc.identifierhttps://arxiv.org/abs/cs/0611144
dc.identifierhttp://arxiv.org/abs/cs/0611144
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133927
dc.subjectNetworking and Internet Architecture
dc.subjectInformation Theory
dc.titleCoding Improves the Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Models
dc.typetext

Files

Collections

arXiv