Throughput-delay tradeoff in mobile ad hoc networks with correlated mobility

Throughput-delay tradeoff in mobile ad hoc networks with correlated mobility
复制标题

DOI:
10.1109/infocom.2014.6848226
复制
发表时间:
2014-07
期刊:
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
影响因子:
--
通讯作者:
Jiajia Liu;Hiroki Nishiyama;N. Kato;Jianfeng Ma;Xiaohong Jiang
Jiajia Liu;Hiroki Nishiyama;N. Kato;Jianfeng Ma;Xiaohong Jiang
中科院分区:
其他
文献类型:
--
作者:
Jiajia Liu;Hiroki Nishiyama;N. Kato;Jianfeng Ma;Xiaohong Jiang

文献摘要

被引文献

相似文献

参考点群移动(RPGM)是一种实用的移动模型,用于在许多重要应用中有效地捕获移动节点之间的潜在相关性。在本文中,我们探讨了在RPGM模型下运行的移动自组织网络(MANET)的吞吐量-延迟权衡以及节点移动速度的一般设置。特别地,我们考虑一个单位面积,n个节点的MANET被均匀地分成Θ(nα)组,α∈[0,1],其中每组的中心按照一个随机方向模型移动,速度不大于v∈[0,1]。我们确定了在这种网络中可以实现的每个节点吞吐量、平均延迟及其权衡(在顺序意义上)的区域。对于v =0的区域,我们首先证明了每个节点的吞吐量容量为Θ(n-α/2),然后开发了一种路由方案来实现这一容量,使得对于任意α∈[0,1],平均延迟为Θ(max1/2, n1-α)。对于v > 0区域,我们证明了该区域的每节点吞吐量可以提高到Θ(1),对于v = 0(1)采用平均延迟Θ(max{n1-α, na/2/v}),对于v = Θ(1)采用平均延迟Θ(n)的路由方案可以实现。本文的结果有助于我们对基本的性能缩放规律有深入的了解,并且能够在具有相关移动性的manet中实现有效的吞吐量-延迟权衡。
Reference Point Group Mobility (RPGM) has been a practical mobility model used to efficiently capture the potential correlation among mobile nodes in many important applications. In this paper, we explore the throughput-delay tradeoff in a mobile ad hoc network (MANET) operating under the RPGM model and also a general setting of node moving speed. In particular, we consider a MANET with unit area and n nodes being divided evenly into Θ(nα) groups, α ∈ [0,1], where the center of each group moves according to a random direction model with speed no more than v ∈ [0,1]. We determine the regions of per node throughput, average delay and their tradeoffs that can be achieved (in order sense) in such a network. For the regime of v =0, we first prove that the per node throughput capacity is Θ(n-α/2), and then develop a routing scheme to achieve this capacity, resulting an average delay of Θ(max1/2, n1-α) for any α ∈ [0,1]. Regarding the regime of v > 0, we prove that the per node throughput capacity there can be improved to Θ(1), which is achievable by adopting a new routing scheme with an average delay of Θ(max{n1-α, na/2/v}) for v = o(1) and Θ(n) for v = Θ(1). The results in this paper help us to have a deep understanding on the fundamental performance scaling laws and also enable an efficient throughput-delay tradeoff to be achieved in MANETs with correlated mobility.