Queuing network models for delay analysis of multihop wireless ad hoc networks
Queuing network models for delay analysis of multihop wireless ad hoc networks
复制标题
DOI：
10.1145/1143549.1143704
复制
发表时间：
2006-07
期刊：
影响因子：
--
通讯作者：
Nabhendra Bisnik;A. Abouzeid
中科院分区：
文献类型：
--
作者：
Nabhendra Bisnik;A. Abouzeid
在本文中，我们重点描述具有固定节点的随机接入多跳无线自组织网络中的平均端到端延迟和每节点可实现的最大吞吐量。我们提出了一个分析模型，该模型考虑了节点数量、随机数据包到达过程、流量的局部性范围以及随机访问 MAC 的回退和冲突避免机制。我们将随机接入多跳无线网络建模为开放的 G/G/1 排队网络，并使用扩散近似来评估平均端到端延迟的封闭形式表达式。导出节点的平均服务时间并用于获得每个节点可实现的最大吞吐量。本文讨论了从排队网络分析中获得的分析结果与关于自组织网络中吞吐量和延迟缩放定律的完善的信息论结果的异同。我们进行了广泛的模拟，并验证分析结果与模拟获得的结果非常匹配。
In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. We present an analytical model that takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC. We model random access multihop wireless networks as open G/G/1 queuing networks and use the diffusion approximation to evaluate closed form expressions for the average end-to-end delay. The mean service time of nodes is derived and used to obtain the maximum achievable per-node throughput. The analytical results obtained here from the queuing network analysis are discussed with regard to similarities and differences from the well established information-theoretic results on throughput and delay scaling laws in ad hoc networks. We perform extensive simulations and verify that the analytical results closely match the results obtained from simulations.