Network Coding-Aware Routing in Wireless Networks
Network Coding-Aware Routing in Wireless Networks
复制标题
DOI：
10.1109/tnet.2010.2042727
复制
发表时间：
2010-08
期刊：
影响因子：
--
通讯作者：
S. Sengupta;Shravan K. Rayanchu;Suman Banerjee
中科院分区：
文献类型：
--
作者：
S. Sengupta;Shravan K. Rayanchu;Suman Banerjee
最近由Katti(Proc.ACM SIGCOMM 2006，pp.243-254)-为了提高无线多跳网络中单播业务的吞吐量，通过机会性网络编码利用了无线介质的广播特性。本文从理论上分析了COP型网络编码在无线网络中对吞吐量的改善。我们做出了两个关键贡献。首先，我们得到了在任何无线网络拓扑和任何并发单播业务会话模式下计算网络编码吞吐量的理论公式。其次，我们主张让路由意识到网络编码的机会，而不是像在应对中那样，忽视它。更重要的是，我们的模型考虑了相互靠近以利用编码机会的路由流与彼此远离以避免无线干扰之间的权衡。我们的理论公式提供了一种方法来计算源-目的路径，并利用可用路径中的最佳编码机会来最大化吞吐量。我们在我们的优化框架中处理受无线发送/接收分集和链路干扰影响的广播传输的调度。使用我们的公式，我们比较了传统的单播路由和网络编码与编码无关和编码感知的路由在各种Mesh网络拓扑上的性能，包括来自当代Mesh网络测试床的一些。我们的评估表明，与编码无关的路由策略相比，感知网络编码机会的路由选择策略可以获得更高的端到端吞吐量。
A recent approach-COPE, presented by Katti (Proc. ACM SIGCOMM 2006, pp. 243-254)-for improving the throughput of unicast traffic in wireless multihop networks exploits the broadcast nature of the wireless medium through opportunistic network coding. In this paper, we analyze throughput improvements obtained by COPE-type network coding in wireless networks from a theoretical perspective. We make two key contributions. First, we obtain a theoretical formulation for computing the throughput of network coding on any wireless network topology and any pattern of concurrent unicast traffic sessions. Second, we advocate that routing be made aware of network coding opportunities rather than, as in COPE, being oblivious to it. More importantly, our model considers the tradeoff between routing flows close to each other for utilizing coding opportunities and away from each other for avoiding wireless interference. Our theoretical formulation provides a method for computing source-destination routes and utilizing the best coding opportunities from available ones so as to maximize the throughput. We handle scheduling of broadcast transmissions subject to wireless transmit/receive diversity and link interference in our optimization framework. Using our formulations, we compare the performance of traditional unicast routing and network coding with coding-oblivious and coding-aware routing on a variety of mesh network topologies, including some derived from contemporary mesh network testbeds. Our evaluations show that a route selection strategy that is aware of network coding opportunities leads to higher end-to-end throughput when compared to coding-oblivious routing strategies.