无线多跳网络中多速率Anypath路由的多项式时间算法
Polynomial-Time Algorithms for Multirate Anypath Routing in Wireless Multihop Networks
摘要：
在本文中，我们提出了一个新的路由范式，概括了无线多跳网络的机会路由。在多速率无路径路由中，每个节点使用一组下一跳和选定的传输速率到达目的地。使用该速率，数据包被广播到集合中的节点，其中一个节点将数据包转发到目的地。到目前为止，还没有能够联合优化下一跳的集合和每个节点使用的传输速率的理论。我们解决了这个问题，通过引入两个多项式时间路由算法，并提供其最优性的证明。所提出的算法运行在大致相同的运行时间，定期最短路径算法，因此，适合部署在路由协议。我们在802.11b测试床网络中进行了测量，我们的跟踪驱动分析表明，多速率anypath路由的平均性能比固定速率为11 Mbps的anypath路由高出80%和6.4倍。如果将速率固定为1 Mbps，则性能最多可提高一个数量级。
英文摘要：
In this paper we present a new routing paradigm that generalizes opportunistic routing for wireless multihop networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set and one of them forwards the packet on to the destination. To date, there has been no theory capable of jointly optimizing both the set of next hops and the transmission rate used by each node. We solve this by introducing two polynomial-time routing algorithms and provide the proof of their optimality. The proposed algorithms run in roughly the same running time as regular shortest-path algorithms, and are therefore suitable for deployment in routing protocols. We conducted measurements in an 802.11b testbed network, and our trace-driven analysis shows that multirate anypath routing performs on average 80% and up to 6.4 times better than anypath routing with a fixed rate of 11 Mbps. If the rate is fixed at 1 Mbps instead, performance improves by up to one order of magnitude.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
