arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0705.0326cs.NIcs.ITmath.IT
收藏

移动Ad-Hoc网络中最优时延-吞吐量权衡:混合随机游走和一维移动模型

Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models

Lei Ying, R. Srikant

摘要:

在[23]中已经建立了二维i.i.d移动性模型的最佳延迟-吞吐量权衡,其中我们表明,当所需的延迟保证足够大时,可以使用无速率码实现最佳权衡。在本文中,我们将结果推广到其他的迁移模型,包括二维混合随机游动模型,一维独立同分布模型。迁移模型和一维混合随机游走模型。我们同时考虑了快速移动和慢速移动,并在一定条件下建立了最佳的延迟吞吐量权衡。联合编码调度算法也提出了实现最佳的权衡。

英文摘要:

Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility models have been established in [23], where we showed that the optimal trade-offs can be achieved using rate-less codes when the required delay guarantees are sufficient large. In this paper, we extend the results to other mobility models including two-dimensional hybrid random walk model, one-dimensional i.i.d. mobility model and one-dimensional hybrid random walk model. We consider both fast mobiles and slow mobiles, and establish the optimal delay-throughput trade-offs under some conditions. Joint coding-scheduling algorithms are also proposed to achieve the optimal trade-offs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑