Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks

In this paper, we investigate the delay-throughput tradeoffs in mobile ad-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.

[1]  Devavrat Shah,et al.  Throughput and Delay in Random Wireless Networks With Restricted Mobility , 2007, IEEE Transactions on Information Theory.

[2]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[3]  Ness B. Shroff,et al.  Towards achieving the maximum capacity in large mobile wireless networks under delay constraints , 2004, Journal of Communications and Networks.

[4]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[5]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[6]  Ashish Agarwal,et al.  Improved capacity bounds for wireless networks , 2004, Wirel. Commun. Mob. Comput..

[7]  Andrea J. Goldsmith,et al.  Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.

[8]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[9]  Venkatesh Saligrama,et al.  Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime , 2006, IEEE Transactions on Information Theory.

[10]  Devavrat Shah,et al.  Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets , 2006, IEEE Transactions on Information Theory.

[11]  Devavrat Shah,et al.  Oblivious Routing with Mobile Fusion Centers over a Sensor Network , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[13]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[14]  Suhas Diggavi,et al.  Even one-dimensional mobility increases ad hoc wireless capacity , 2002, Proceedings IEEE International Symposium on Information Theory,.

[15]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[16]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[18]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  Ness B. Shroff,et al.  The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks , 2004 .

[20]  Massimo Franceschetti,et al.  Closing the gap in the capacity of random wireless networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[21]  Devavrat Shah,et al.  Optimal throughput-delay scaling in wireless networks - part I: the fluid model , 2006, IEEE Transactions on Information Theory.

[22]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[23]  R. Srikant,et al.  Coding Improves the Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Models , 2006, ArXiv.

[24]  Olivier Leveque,et al.  How does the information capacity of ad hoc networks scale , 2006 .

[25]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.

[26]  Massimo Franceschetti,et al.  On the throughput capacity of random wireless networks , 2004 .

[27]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[28]  PrabhakarBalaji,et al.  Optimal throughput-delay scaling in wireless networks , 2006 .

[29]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .