Impact of interference on multi-hop wireless network performance
Impact of interference on multi-hop wireless network performance
复制标题
DOI：
10.1007/s11276-005-1769-9
复制
发表时间：
2005-07-01
影响因子：
3
通讯作者：
Qiu, LL
中科院分区：
文献类型：
--
作者：
Jain, K;Padhye, J;Qiu, LL
在本文中，我们解决了以下问题：给定无线节点在物理空间中的特定位置和特定的交通工作负载，最大的吞吐量是由生成的网络支持的？与以前的工作不同的是，在网络拓扑和/或工作负载中的均匀性或随机性的假设下计算渐近性能界限，我们与指定为输入的任何给定的网络和工作负载一起工作。影响性能的关键问题是相邻节点之间的无线干扰。我们使用冲突图对这种干扰进行建模，并提供用于在给定网络和工作负载的最佳吞吐量上计算上和下限的方法。为了计算这些界限，我们假设单个节点处的数据包传输可以由一个不现实的无所不知和无所不能的中央实体对单个节点进行精心控制和仔细安排，这是不现实的。然而，使用NS-2模拟，我们表明，从我们的分析中得出的路线通常比默认最短路径路由的吞吐量明显更好，即使在存在未协同协调的数据包传输和MAC争论的情况下也是如此。这表明有机会通过采用干扰意识的路由协议来实现吞吐量的收益。
In this paper, we address the following question: given a specific placement of wireless nodes in physical space and a specific traffic workload, what is the maximum throughput that can be supported by the resulting network? Unlike previous work that has focused on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and/or workload, we work with any given network and workload specified as inputs.A key issue impacting performance is wireless interference between neighboring nodes. We model such interference using a conflict graph, and present methods for computing upper and lower bounds on the optimal throughput for the given network and workload. To compute these bounds, we assume that packet transmissions at the individual nodes can be finely controlled and carefully scheduled by an omniscient and omnipotent central entity, which is unrealistic. Nevertheless, using ns-2 simulations, we show that the routes derived from our analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention. This suggests that there is opportunity for achieving throughput gains by employing an interference-aware routing protocol.