arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1310.8374cs.NI
收藏

泊松会晤过程下ICMN的容量与时延-吞吐量权衡

Capacity and Delay-Throughput Tradeoff in ICMNs with Poisson Meeting Process

Yin Chen, Yulong Shen, Jinxiao Zhu, Xiaohong Jiang

摘要:

间歇连接的移动网络(ICMNs)是一种重要的网络模型,用于许多关键应用。本文研究了一个连续的ICMN模型,其中网络节点间的成对会晤过程服从齐次独立泊松过程。这种ICMN模型被认为是一类重要的ICMN的移动性模型,如随机航路点和随机方向,所以它被广泛采用的ICMN的性能研究。研究了具有泊松会议过程的ICMN的吞吐量和时延吞吐量折衷问题。对于有关的ICMN,我们首先推导出一个精确的表达,其吞吐量的基础上的成对会议率在其中,并分析了预期的端到端的数据包延迟下的路由算法,可以实现的吞吐量能力。然后,我们探讨延迟和吞吐量之间的内在权衡,并建立一个必要条件,这样的权衡下,在ICMN的任何路由算法。为了说明理论结果的适用性,案例研究进一步进行随机航路点和随机方向移动模型。最后,仿真和数值结果验证了我们的理论容量/延迟结果的效率,并说明我们的研究结果。

英文摘要:

Intermittently connected mobile networks (ICMNs) serve as an important network model for many critical applications. This paper focuses on a continuous ICMN model where the pair-wise meeting process between network nodes follows a homogeneous and independent Poisson process. This ICMN model is known to serve as good approximations to a class of important ICMNs with mobility models like random waypoint and random direction, so it is widely adopted in the performance study of ICMNs. This paper studies the throughput capacity and delay-throughput tradeoff in the considered ICMNs with Poisson meeting process. For the concerned ICMN, we first derive an exact expression of its throughput capacity based on the pairwise meeting rate therein and analyze the expected end-to-end packet delay under a routing algorithm that can achieve the throughput capacity. We then explore the inherent tradeoff between delay and throughput and establish a necessary condition for such tradeoff that holds under any routing algorithm in the ICMN. To illustrate the applicability of the theoretical results, case studies are further conducted for the random waypoint and random direction mobility models. Finally, simulation and numerical results are provided to verify the efficiency of our theoretical capacity/delay results and to illustrate our findings.

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

↑