TY - JOUR
T1 - Optimal delay-throughput tradeoffs in mobile Ad Hoc networks
AU - Ying, Lei
AU - Yang, Sichao
AU - Srikant, R.
N1 - Funding Information:
Manuscript received May 2, 2007; revised December 26, 2007. Published August 27, 2008 (projected). This work was supported in part by a Vodafone Fellowship and a National Science Foundation under Grants CNS 05-19691, CCF 06-34891, CNS 07-21286, CCF 03-25673. The material in this paper was presented at WiOpt 2007, Limassol, Cyprus, April 2007 and the ITA Workshop, San Diego, CA, January2007.
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
KW - Delay-throughput tradeoffs
KW - Hybrid random walk models
KW - Independent and identically distributed (i.i.d.) mobility models
KW - Mobile ad hoc networks
KW - Rate-less codes
KW - Scaling laws
UR - http://www.scopus.com/inward/record.url?scp=51349093494&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51349093494&partnerID=8YFLogxK
U2 - 10.1109/TIT.2008.928247
DO - 10.1109/TIT.2008.928247
M3 - Article
AN - SCOPUS:51349093494
SN - 0018-9448
VL - 54
SP - 4119
EP - 4143
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 9
ER -