Routing performance in the presence of unidirectional links in multihop wireless networks
Routing performance in the presence of unidirectional links in multihop wireless networks
复制标题
DOI：
10.1145/513800.513803
复制
发表时间：
2002-06
期刊：
影响因子：
--
通讯作者：
M. Marina;Samir R Das
中科院分区：
文献类型：
--
作者：
M. Marina;Samir R Das
我们研究两个方面的影响，单向链路的路由性能在多跳无线网络。在本文的第一部分，我们评估的好处，利用单向链路路由，而不是只使用双向链路。我们的评估是基于三个发射功率分配模型，反映了一些现实的网络场景与单向链路。我们的研究结果表明，使用一个高开销的路由协议，利用单向links的边际效益是值得怀疑的。然而，最常见的路由协议简单地假设，所有的网络链路是双向的，因此可能需要额外的协议动作，以消除单向链路的路由计算。在论文的第二部分中，我们使用众所周知的按需路由协议Ad hoc按需距离矢量（AODV）作为案例研究来研究这个问题。我们研究了三种技术的性能AODV在存在单向链路即黑名单，你好和ReversePathSearch的有效操作。虽然黑名单和Hello技术明确地消除了单向链接，但ReversePathSearch技术利用了节点之间存在的多条路径所提供的更大的网络连接性。在不同数量的单向链路和节点速度下使用ns-2模拟的性能结果表明，这三种技术都通过避免单向链路来提高性能，其中ReversePathSearch技术是最有效的。
We examine two aspects concerning the influence of unidirectional links on routing performance in multihop wireless networks. In the first part of the paper we evaluate the benefit from utilizing unidirectional links for routing as opposed to using only bidirectional links. Our evaluations are based on three transmit power assignment models that reflect some realistic network scenarios with unidirectional links. Our results indicate that the marginal benefit of using a high-overhead routing protocol to utilize unidirectional links is questionable.Most common routing protocols however simply assume that all network links are bidirectional and thus may need additional protocol actions to remove unidirectional links from route computations. In the second part of the paper we investigate this issue using a well known on-demand routing protocol Ad hoc On-demand Distance Vector (AODV) as a case study. We study the performance of three techniques for AODV for efficient operation in presence of unidirectional links viz. BlackListing Hello and ReversePathSearch. While BlackListing and Hello techniques explicitly eliminate unidirectional links the ReversePathSearch technique exploits the greater network connectivity offered by the existence of multiple paths between nodes. Performance results using ns-2 simulations under varying number of unidirectional links and node speeds show that all three techniques improve performance by avoiding unidirectional links the ReversePathSearch technique being the most effective.