By Topic

Coding Achieves the Optimal Delay-Throughput Trade-off in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Model with Fast Mobiles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lei Ying ; Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL ; Sichao Yang ; Srikant, R.

In this paper, we investigate the delay-throughput trade-off in mobile ad-hoc networks under two-dimensional i.i.d. mobility model with fast mobiles, and show that the optimal trade-off can be achieved using rate-less codes. Given a delay constraint D, we first prove that the maximum throughput per source-destination (S-D) pair is O(radic(D/n)) , and then propose a joint coding-scheduling algorithm to achieve the maximum throughput. The result can be extended to two-dimensional i.i.d. mobility model with slow mobiles, one-dimensional mobility models, and hybrid random walk mobility models.

Published in:

Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops, 2007. WiOpt 2007. 5th International Symposium on

Date of Conference:

16-20 April 2007