ACM Transactions on Computer Systems (TOCS)
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Opportunistic routing in multi-hop wireless networks
ACM SIGCOMM Computer Communication Review
Divert: fine-grained path selection for wireless LANs
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Link-level measurements from an 802.11b mesh network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
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
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Multipath code casting for wireless mesh networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Block-switched networks: a new paradigm for wireless transport
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The quality of wireless links is inherently dynamic, and this often makes the measurements of link delivery probabilities inaccurate over short timescales. We present Stable Opportunistic Routing (SOR), which improves unicast throughput for wireless mesh routing in the presence of inaccurate link-level measurements. In essence, SOR integrates two key features of prior approaches: (i) nodes trigger or suppress transmissions by inferring the actual reception of packets by neighboring nodes through channel overhearing, and (ii) nodes use network coding to avoid redundant transmissions. In addition, SOR is less dependent on accurate timing estimates or measured loss rates than prior approaches. Our stance is to argue that by carefully incorporating prior approaches into the design space of SOR, we can make opportunistic routing more robust toward link-level measurement errors, a practical issue in wireless mesh routing. Using nsclick simulation, we show that SOR has higher throughput than existing shortest-path and opportunistic routing protocols in large-scale networks, and the performance gain is more prominent when link-level measurements are erroneous.