Capacity Scaling in Ad Hoc Networks With Heterogeneous Mobile Nodes: The Super-Critical Regime
Capacity Scaling in Ad Hoc Networks With Heterogeneous Mobile Nodes: The Super-Critical Regime
复制标题
DOI：
10.1109/tnet.2008.2010218
复制
发表时间：
2009-10
期刊：
影响因子：
--
通讯作者：
M. Garetto;P. Giaccone;Emilio Leonardi
中科院分区：
文献类型：
--
作者：
M. Garetto;P. Giaccone;Emilio Leonardi
分析了具有异构性和空间异构性的移动自组网的容量扩展规律。以往的大部分工作都依赖于节点相同且统一访问整个网络空间的假设。然而，实验数据表明，单个节点的移动模式通常在区域内受限，而由于节点集中点的存在，整体节点密度往往是很大程度上不均匀的。本文介绍了一类同时包含受限移动性和非均匀节点密度的移动网络，并描述了一种利用存储-进位通信范例来计算这些网络中可达到的渐近吞吐量的方法。我们展示了如何在温和的假设下将分析映射到关联的广义随机几何图(GRGG)上的最大并发流(MCF)问题。此外，我们还提出了一种渐近最优的调度和路由方案，使网络容量达到最大。
We analyze the capacity scaling laws of mobile ad hoc networks comprising heterogeneous nodes and spatial inhomogeneities. Most of previous work relies on the assumption that nodes are identical and uniformly visit the entire network space. Experimental data, however, show that the mobility pattern of individual nodes is usually restricted over the area, while the overall node density is often largely inhomogeneous due to the presence of node concentration points. In this paper we introduce a general class of mobile networks which incorporates both restricted mobility and inhomogeneous node density, and describe a methodology to compute the asymptotic throughput achievable in these networks by the store-carry-forward communication paradigm. We show how the analysis can be mapped, under mild assumptions, into a Maximum Concurrent Flow (MCF) problem over an associated Generalized Random Geometric Graph (GRGG). Moreover, we propose an asymptotically optimal scheduling and routing scheme that achieves the maximum network capacity.