The Canadian Traveller Problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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
The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks
Mobile Networks and Applications
A high-throughput path metric for multi-hop wireless routing
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Optimal channel probing and transmission scheduling for opportunistic spectrum access
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
IEEE 802.11s wireless mesh networks: Framework and challenges
Ad Hoc Networks
Cross-layer wireless bit rate adaptation
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Route planning under uncertainty: the Canadian traveller problem
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Wireless mesh networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Predictable 802.11 packet delivery from wireless channel measurements
Proceedings of the ACM SIGCOMM 2010 conference
Hi-index | 0.00 |
Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, without focusing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based anypath forwarding, with explicit consideration of transient link uncertainties. Starting from a two-state link capacity model, we show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP) [1]. Inspired by a stochastic recoverable version of CTP (SRCTP), we develop an practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next-hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We further extend our solution to a general multi-rate link model, and present a Stopping Theory (ST) based solution, which naturally degrades to the SRCTP algorithm in the two-state link model. We conduct simulation studies to verify the effectiveness of the SRCTP and ST algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51.15-73.02% for two-state links, 5.16% for multi-rate links) and improvement on packet delivery ratio (99.76% for two-state links, 94.44% for multi-rate links) are observed. By using RTS/CTS as the online probing tool in ns3 simulator, we observed both significant goodput improvements (29.9% than EXOR, 61.8% than HWMP) and much less packet arriving jitter (14.27 times less than EXOR, 45% less than HWMP) as compared to EXOR and HWMP routing protocols.