Research Article
Coding Achieves the Optimal Delay-Throughput Trade-off in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Model with Fast Mobiles
@INPROCEEDINGS{10.1109/WIOPT.2007.4480024, author={ Lei Ying and Sichao Yang and R. Srikant}, title={Coding Achieves the Optimal Delay-Throughput Trade-off in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Model with Fast Mobiles}, proceedings={5th International ICST Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks}, publisher={IEEE}, proceedings_a={WIOPT}, year={2008}, month={3}, keywords={Ad hoc networks Data communication Delay effects Interference constraints MIMO Mobile computing Routing Signal processing algorithms Throughput Wireless networks}, doi={10.1109/WIOPT.2007.4480024} }- Lei Ying
Sichao Yang
R. Srikant
Year: 2008
Coding Achieves the Optimal Delay-Throughput Trade-off in Mobile Ad-Hoc Networks: Two-Dimensional I.I.D. Mobility Model with Fast Mobiles
WIOPT
IEEE
DOI: 10.1109/WIOPT.2007.4480024
Abstract
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.
Copyright © 2007–2024 IEEE
