Throughput, Delay, and Mobility in Wireless Ad Hoc Networks
Throughput, Delay, and Mobility in Wireless Ad Hoc Networks
复制标题
DOI：
10.1109/infcom.2010.5461902
复制
发表时间：
2010-03
期刊：
影响因子：
--
通讯作者：
Pan Li;Yuguang Fang;Jie Li
中科院分区：
文献类型：
--
作者：
Pan Li;Yuguang Fang;Jie Li
无线自组织网络的吞吐量容量已经在许多不同的移动模型下得到了广泛的研究，如i.i.d.迁移率模型、布朗迁移率模型、随机游走模型等，这些研究工作大多假设全局迁移，即，每个节点在整个网络中移动，结果表明，可以以非常高的期望平均端到端延迟为代价来实现恒定的每个节点吞吐量。因此，我们在这里有一个非常大的差距，无论是静态网络中的低吞吐量和低延迟，还是移动的网络中的高吞吐量和高延迟。在本文中，采用一个更实际的限制随机移动模型，我们试图填补这一空白。具体地说，我们假设一个单位面积的网络，有n个节点，被均匀地分成n ^{2}个单元，面积为n^{-2}，其中0 1/2，每个单元又被均匀地分成n^{-2}，其中0 1/2的正方形。所有节点只能在它们最初分布的单元内移动，并且在每个时隙的开始，每个节点从其当前正方形移动到均匀选择的相邻正方形中的均匀选择的点。提出了一种新的多跳中继方案，分别给出了每个节点吞吐量和期望平均端到端时延的上界和下界。最后，我们明确地显示通过控制节点的移动性，吞吐量和延迟之间的平滑权衡。
Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random walk model, and so on. Most of these research works assume global mobility, i.e., each node moves around in the whole network, and the results show that a constant per-node throughput can be achieved at the cost of very high expected average end-to-end delay. Thus, we are having a very big gap here, either low throughput and low delay in static networks or high throughput and high delay in mobile networks. In this paper, employing a more practical restricted random mobility model, we try to fill in this gap. Specifically, we assume a network of unit area with n nodes is evenly divided into n^{2α} cells with an area of n^{-2α} where 0 ≤ α ≤ 1/2, each of which is further evenly divided into squares with an area of n^{-2β} where 0 ≤ α ≤ β ≤1/2. All nodes can only move inside the cell which they are initially distributed in, and at the beginning of each time slot, every node moves from its current square to a uniformly chosen point in an uniformly chosen adjacent square. Proposing a new multi-hop relay scheme, we present an upper bound and a lower bound on per-node throughput capacity and expected average end-to-end delay, respectively. We finally explicitly show smooth trade-offs between throughput and delay by controlling nodes' mobility.