Optimal delay-throughput tradeoffs in mobile Ad Hoc networks

Lei Ying, Sichao Yang, R. Srikant

Research output: Contribution to journalArticlepeer-review

117 Scopus citations


In this paper, we investigate the delay-throughput tradeoffs in mobile iad-hoc networks. We consider four node mobility models: 1) two-dimensional independent and identically distributed (i.i.d.) mobility, 2) two-dimensional hybrid random walk, 3) one-dimensional i.i.d. mobility, and 4) one-dimensional hybrid random walk. Two mobility time scales are included in this paper. 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, we first characterize the maximum throughput per source-destination (S-D) pair for each of the four mobility models with fast or slow mobiles. We then develop joint coding-scheduling algorithms to achieve the optimal delay-throughput tradeoffs.

Original languageEnglish (US)
Pages (from-to)4119-4143
Number of pages25
JournalIEEE Transactions on Information Theory
Issue number9
StatePublished - 2008


  • Delay-throughput tradeoffs
  • Hybrid random walk models
  • Independent and identically distributed (i.i.d.) mobility models
  • Mobile ad hoc networks
  • Rate-less codes
  • Scaling laws

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Optimal delay-throughput tradeoffs in mobile Ad Hoc networks'. Together they form a unique fingerprint.

Cite this