Polynomial-time algorithms for multirate anypath routing in wireless multihop networks

Authors:
Rafael Laufer;Henri Dubois-Ferrière;Leonard Kleinrock
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA;Riverbed Technology, Inc., Lausanne, Switzerland;Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 17
Cited 1

The click modular router

ACM Transactions on Computer Systems (TOCS)
Introduction to algorithms

Introduction to algorithms
A high-throughput path metric for multi-hop wireless routing

Proceedings of the 9th annual international conference on Mobile computing and networking
Routing in multi-radio, multi-hop wireless mesh networks

Proceedings of the 10th annual international conference on Mobile computing and networking
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Improving loss resilience with multi-radio diversity in wireless networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Measurement-based models of delivery and interference in static wireless networks

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
GRAdient broadcast: a robust data delivery protocol for large scale sensor networks

Wireless Networks
On selection of candidates for opportunistic anypath forwarding

ACM SIGMOBILE Mobile Computing and Communications Review
Trading structure for randomness in wireless opportunistic routing

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Exploiting path diversity in the link layer in wireless ad hoc networks

Ad Hoc Networks
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance

IEEE Transactions on Mobile Computing
A joint approach to routing metrics and rate adaptation in wireless mesh networks

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
The κ factor: inferring protocol performance using inter-link reception correlation

Proceedings of the sixteenth annual international conference on Mobile computing and networking
Valuable detours: least-cost anypath routing

IEEE/ACM Transactions on Networking (TON)
Trust management in mobile ad hoc networks using a scalable maturity-based model

IEEE Transactions on Network and Service Management
Routing Metrics and Protocols for Wireless Mesh Networks

IEEE Network: The Magazine of Global Internetworking

Practical opportunistic routing in high-speed multi-rate wireless mesh networks

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 is 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 have 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 is on average 80% better than 11-Mbps anypath routing, with a factor of 6.4 improvement in the best case. If the rate is fixed at 1 Mbps instead, performance improves by a factor of 5.4 on average.