Queueing models for the performance of multihop routing in a intermittently-connected mobile network
Queueing models for the performance of multihop routing in a intermittently-connected mobile network
复制标题
DOI：
10.1109/icc.2012.6364061
复制
发表时间：
2012-06
期刊：
影响因子：
--
通讯作者：
R. Subramanian;F. Fekri
中科院分区：
文献类型：
--
作者：
R. Subramanian;F. Fekri
考虑一个连续连接的移动的ad-hoc网络，其源/目的地由n个移动的中继节点辅助，每个中继节点具有有限的存储缓冲区。在本文中，我们开发的，第一次，在这样一个网络中的多跳路由的稳态性能的分析与一般的移动性模型，并表征它的吞吐量和传输成本开销。我们调查多跳路由是否有任何改进的潜力超过两跳路由。我们表明，多跳下的性能分析模型，可以通过采用嵌入式马尔可夫链识别的理论技术。所提供的解决方案是在非线性稳态方程的形式，可以有效地迭代求解。这项工作的主要成果是，多跳确实可以改善两跳路由在有限缓冲区制度，通过减轻减少吞吐量所造成的有限存储（导致阻塞/饱和的缓冲区）。然而，吞吐量的改善随着缓冲器大小的增长而减少，并且以额外的中继到中继传输为代价。
Consider an intermittently-connected mobile ad-hoc network with a single source/destination aided by n mobile relay nodes each of which has a finite storage buffer. In this paper we develop, for the first time, an analysis of the steady-state performance of multihop routing in such a network with a general mobility model and characterize it in terms of throughput and transmission-cost overhead. We investigate whether multihop routing has any potential for improvement over two hop routing. We show that analytical models for performance under multihop can be obtained by employing queuing-theoretic techniques and embedded-Markov-chain identification. The solution offered is in the form of non-linear steady-state equations which can be efficiently solved iteratively. The key outcome of this work is that multihop can indeed improve upon two-hop routing in the finite-buffer regime, by means of mitigating the reduction in throughput caused by limited storage (leading to blocking/saturation of buffers). However, the improvement in throughput diminishes as the buffer size grows, and comes at the cost of additional relay-to-relay transmissions.